Display options:
Normal
Show Abstracts
Compact
Select/unselect all
Displaying article 116
Research
p. 389401
Received: 11 June 2011; Accepted: 21 June 2011 / Published: 29 June 2011
Show/Hide Abstract
 PDF Fulltext (266 KB)
Abstract: From the physics point of view, time is now best described through General Relativity as part of spacetime, which is a dynamical object encoding gravity. Time possesses also some intrinsic irreversibility due to thermodynamics and quantum mechanical effects. This irreversibility can look puzzling since timelike loops (and hence time machines) can appear in General Relativity (for example in the Gödel universe, a solution of Einstein’s equations). We take this apparent discrepancy as a warning bell, pointing out that time as we understand it might not be fundamental and that whatever theory lying beyond General Relativity may not include time as we know it as a fundamental structure. We propose therefore, following the philosophy of analog models of gravity, that time and gravity might not be fundamental per se, but only emergent features. We illustrate our proposal using a toymodel where we show how the Lorentzian signature and Nordström gravity (a diffeomorphisms invariant scalar gravity theory) can emerge from a timeless nondynamical space. This article received the fourth prize at the essay competition of the Foundational Questions Institute on the nature of time.
p. 402442
Received: 11 January 2011; in revised form: 15 June 2011 / Accepted: 30 June 2011 / Published: 7 July 2011
Show/Hide Abstract
 Cited by 3  PDF Fulltext (1531 KB)
Abstract: The author used the automatic proof procedure introduced in [1] and verified that the 4096 homomorphic recurrent double sequences with constant borders defined over Klein’s Vierergruppe K and the 4096 linear recurrent double sequences with constant border defined over the matrix ring M _{2} (F_{2} ) can be also produced by systems of substitutions with finitely many rules. This permits the definition of a sound notion of geometric content for most of these sequences, more exactly for those which are not primitive. We group the 4096 many linear recurrent double sequences with constant border I over the ring M _{2} (F_{2} ) in 90 geometric types. The classification over Klein’s Vierergruppe Kis not explicitly displayed and consists of the same geometric types like for M _{2} (F_{2} ), but contains more exceptions. There are a lot of cases of unsymmetric double sequences converging to symmetric geometric contents. We display also geometric types occurring both in a monochromatic and in a dichromatic version.
p. 443456
Received: 11 April 2011; in revised form: 2 June 2011 / Accepted: 29 June 2011 / Published: 11 July 2011
Show/Hide Abstract
 PDF Fulltext (228 KB)
Abstract: Symmetric patterns are more appealing to human observers than asymmetric ones. Here, we investigate the visual information processing mechanisms underlying this aesthetic preference. All stimuli were derived from phase scrambled versions of forty face or nature images. In addition to the scrambled images, there were four other types of test image: symmetric, in which one part of the image was a reflection of another around an axis; repetitive, in which one part of the image was a copy of the other; antisymmetric, similar to symmetric but with the contrast of one side reversed; and interleaved patterns, in which half of the symmetric pattern was replaced by a scrambled image. The number of axes ranged from 1 to 16 for all image types. The task of our 20 observers was to give a preference rating to each image on a 6point Lickert scale. The preference rating increased with the number of axes for all stimulus types. The observers showed a similar preference for symmetric and repetitive patterns and slightly less preference for antisymmetric patterns. The preference for interleaved patterns was much less than for other types of stimuli. Preference for an image cannot be explained by either the ecological significance of its content or the slope of its amplitude spectrum. Instead, preference can be accounted for by the complexity of the image.
p. 457471
Received: 19 April 2011; in revised form: 9 June 2011 / Accepted: 28 June 2011 / Published: 13 July 2011
Show/Hide Abstract
 Cited by 1  PDF Fulltext (625 KB)
Abstract: Mirror symmetry is often thought to be particularly salient to human observers because it engages specialized mechanisms that evolved to sense symmetrical objects in nature. Although symmetry is indeed present in many of our artifacts and markings on wildlife, studies have shown that sensitivity to mirror symmetry does not serve an alerting function and sensitivity to symmetry decreases in a rather unremarkable way when it is presented away from the centre of the visual field. Here we show that symmetrical targets are vulnerable to the same interference as other stimuli when surrounded by nontarget elements. These results provide further evidence that symmetry is not special to the early visual system, and reinforce the notion that our fascination with symmetry is more likely attributable to cognitive and aesthetic factors than to specialized, low level mechanisms in the visual system.
p. 472486
Received: 27 April 2011; in revised form: 20 June 2011 / Accepted: 22 June 2011 / Published: 15 July 2011
Show/Hide Abstract
 PDF Fulltext (275 KB)
Abstract: An independent set in a graph is a set of pairwise nonadjacent vertices, and α(G) is the size of a maximum independent set in the graph G. A matching is a set of nonincident edges, while μ(G) is the cardinality of a maximum matching. If sk is the number of independent sets of size k in G, then I(G; x) = s_{0} + s_{1} x + s_{2} x_{2} + ... + s_{α} x^{α} , α = α (G), is called the independence polynomial of G (Gutman and Harary, 1986). If sj = s_{α} j for all 0 ≤ j ≤ [α/2], then I(G; x) is called symmetric (or palindromic). It is known that the graph G _{°} 2K_{1} , obtained by joining each vertex of G to two new vertices, has a symmetric independence polynomial (Stevanović, 1998). In this paper we develop a new algebraic technique in order to take care of symmetric independence polynomials. On the one hand, it provides us with alternative proofs for some previously known results. On the other hand, this technique allows to show that for every graph G and for each nonnegative integer k ≤ μ (G), one can build a graph H, such that: G is a subgraph of H, I (H; x) is symmetric, and I (G _{° } 2K1; x) = (1 + x)^{k} · I (H; x).
p. 487502
Received: 27 April 2011; in revised form: 6 July 2011 / Accepted: 6 July 2011 / Published: 20 July 2011
Show/Hide Abstract
 Cited by 2  PDF Fulltext (357 KB)
Abstract: Our paper analyzes some aspects of Uncertainty Measures. We need to obtain new ways to model adequate conditions or restrictions, constructed from vague pieces of information. The classical entropy measure originates from scientific fields; more specifically, from Statistical Physics and Thermodynamics. With time it was adapted by Claude Shannon, creating the current expanding Information Theory. However, the Hungarian mathematician, Alfred Rényi, proves that different and valid entropy measures exist in accordance with the purpose and/or need of application. Accordingly, it is essential to clarify the different types of measures and their mutual relationships. For these reasons, we attempt here to obtain an adequate revision of such fuzzy entropy measures from a mathematical point of view.
p. 503523
Received: 6 April 2011; in revised form: 8 July 2011 / Accepted: 8 July 2011 / Published: 22 July 2011
Show/Hide Abstract
 PDF Fulltext (2910 KB)

Supplementary Files
Abstract: As a contribution to the mysteries of human symmetry perception, reaction time data were collected on the detection of symmetry or repetition violations, in the context of short term visual memory studies. The histograms for reaction time distributions are rather narrow in the case of symmetry judgments. Their analysis was performed in terms of a simple kinetic model of a mental process in two steps, a slow one for the construction of the representation of the images to be compared, and a fast one, in the 50 ms range, for the decision. There was no need for an additional ‘mental rotation’ step. Symmetry seems to facilitate the construction step. I also present here original stimuli showing a color equalization effect across a symmetry axis, and its counterpart in periodic patterns. According to a “folded sheet model”, when a shape is perceived, the brain automatically constructs a mirrorimage representation of the shape. Based in part on the reaction time analysis, I present here an alternative “transparent sheet” model in which the brain constructs a single representation, which can be accessed from two sides, thus generating simultaneously a pattern and its mirrorsymmetric partner. Filtering processes, implied by current models of symmetry perception could intervene at an early stage, by nucleating the propagation of similar perceptual groupings in the two symmetric images.
p. 524540
Received: 6 July 2011; Accepted: 17 July 2011 / Published: 27 July 2011
Show/Hide Abstract
 Cited by 3  PDF Fulltext (322 KB)
Abstract: An analysis of the path integral approach to quantum theory motivates the hypothesis that two experiments with the same classical action should have dual ontological descriptions. If correct, this hypothesis would not only constrain realistic interpretations of quantum theory, but would also act as a constructive principle, allowing any realistic model of one experiment to generate a corresponding model for its actiondual. Two pairs of actiondual experiments are presented, including one experiment that violates the Bell inequality and yet is actiondual to a single particle. The implications generally support retrodictive and retrocausal interpretations.
p. 541563
Received: 21 July 2011; Accepted: 1 August 2011 / Published: 10 August 2011
Show/Hide Abstract
 Cited by 1  PDF Fulltext (414 KB)
Abstract: Cyclotron frequency of a crystal electron is, in general, not an easily accessible parameter. Nevertheless, its calculation can be simplified when the symmetry properties of the band structure and those of the motion equations in the magnetic field are simultaneously taken into account. In effect, a combined symmetry of the electron Hamiltonian and that of the Lorentz equation provide us with a nonlinear oscillator problem of high symmetry. In the next step, the kinetic energy of the oscillator can be separated from the whole of electron energy and applied in a new kind of calculation of the cyclotron frequency which is much more simple than before. In consequence, a detailed approach to the electron circulation, also in more complex band structures, becomes a relatively easy task. For different crystal lattices of cubic symmetry taken as examples the cyclotron frequency of the present and a former method are compared numerically giving the same results.
p. 564573
Received: 2 March 2011; in revised form: 21 July 2011 / Accepted: 28 July 2011 / Published: 15 August 2011
Show/Hide Abstract
 PDF Fulltext (331 KB)
Abstract: The semigroup D_{V} of digraphs on a set V of n labeled vertices is defined. It is shown that D_{V} is faithfully represented by the semigroup B_{n} of n ´ n Boolean matrices and that the Green’s L, R, H, and D equivalence classifications of digraphs in D_{V} follow directly from the Green’s classifications already established for B_{n} . The new results found from this are: (i ) L, R, and H equivalent digraphs contain sets of vertices with identical neighborhoods which remain invariant under certain onesided semigroup multiplications that transform one digraph into another within the same equivalence class, i.e ., these digraphs exhibit Green’s isoneighborhood symmetries ; and (ii ) D equivalent digraphs are characterized by isomorphic inclusion lattices that are generated by their outneighborhoods and which are preserved under certain twosided semigroup multiplications that transform digraphs within the same D equivalence class, i.e ., these digraphs are characterized by Green’s isolattice symmetries . As a simple illustrative example, the Green’s classification of all digraphs on two vertices is presented and the associated Green’s symmetries are identified.
p. 574599
Received: 30 December 2010; in revised form: 10 August 2011 / Accepted: 15 August 2011 / Published: 23 August 2011
Show/Hide Abstract
 Cited by 3  PDF Fulltext (5373 KB)
Abstract: Do there exist circular and spherical copulas in ℝ^{d} ? That is, do there exist circularly symmetric distributions on the unit disk in ℝ^{2} and spherically symmetric distributions on the unit ball in ℝ^{d} , d ≥ 3, whose onedimensional marginal distributions are uniform? The answer is yes for d = 2 and 3, where the circular and spherical copulas are unique and can be determined explicitly, but no for d ≥ 4. A oneparameter family of elliptical bivariate copulas is obtained from the unique circular copula in ℝ^{2} by oblique coordinate transformations. Copulas obtained by a nonlinear transformation of a uniform distribution on the unit ball in ℝ^{d} are also described, and determined explicitly for d = 2.
p. 600610
Received: 27 May 2011; in revised form: 16 August 2011 / Accepted: 23 August 2011 / Published: 26 August 2011
Show/Hide Abstract
 PDF Fulltext (227 KB)
Abstract: Results from the theory of the generalized hypergeometric functions of matrix argument, and the related zonal polynomials, are used to develop a new approach to study the asymptotic distributions of linear functions of uniformly distributed random matrices from the classical compact matrix groups. In particular, we provide a new approach for proving the following result of D’Aristotile, Diaconis, and Newman: Let the random matrix H_{n} be uniformly distributed according to Haar measure on the group of n × n orthogonal matrices, and let A_{n} be a nonrandom n × n real matrix such that tr (A'_{n} A_{n} ) = 1. Then, as n→∞, √n tr A_{n} H_{n} converges in distribution to the standard normal distribution.
p. 611635
Received: 23 February 2011; in revised form: 25 August 2011 / Accepted: 26 August 2011 / Published: 1 September 2011
Show/Hide Abstract
 Cited by 2  PDF Fulltext (303 KB)
Abstract: This paper has three main objectives: (a) Discuss the formal analogy between some important symmetryinvariance arguments used in physics, probability and statistics. Specifically, we will focus on Noether’s theorem in physics, the maximum entropy principle in probability theory, and de Finettitype theorems in Bayesian statistics; (b) Discuss the epistemological and ontological implications of these theorems, as they are interpreted in physics and statistics. Specifically, we will focus on the positivist (in physics) or subjective (in statistics) interpretations vs. objective interpretations that are suggested by symmetry and invariance arguments; (c) Introduce the cognitive constructivism epistemological framework as a solution that overcomes the realismsubjectivism dilemma and its pitfalls. The work of the physicist and philosopher Max Born will be particularly important in our discussion.
p. 636652
Received: 25 July 2011; in revised form: 27 August 2011 / Accepted: 1 September 2011 / Published: 6 September 2011
Show/Hide Abstract
 PDF Fulltext (278 KB)
Abstract: Freiling [1] and Brown [2] have put forward a probabilistic reductio argument intended to refute the Continuum Hypothesis. The argument relies heavily upon intuitions about symmetry in a particular scenario. This paper argues that the argument fails, but is still of interest for two reasons. First, the failure is unusual in that the symmetry intuitions are demonstrably coherent, even though other constraints make it impossible to find a probability model for the scenario. Second, the best probability models have properties analogous to nonconglomerability, motivating a proposed extension of that concept (and corresponding limits on Bayesian conditionalization).
p. 653679
Received: 1 April 2011; in revised form: 30 August 2011 / Accepted: 5 September 2011 / Published: 7 September 2011
Show/Hide Abstract
 Cited by 1  PDF Fulltext (449 KB)
Abstract: In order to make graphical Gaussian models a viable modelling tool when the number of variables outgrows the number of observations, [1] introduced model classes which place equality restrictions on concentrations or partial correlations. The models can be represented by vertex and edge coloured graphs. The need for model selection methods makes it imperative to understand the structure of model classes. We identify four model classes that form complete lattices of models with respect to model inclusion, which qualifies them for an Edwards–Havránek model selection procedure [2]. Two classes turn out most suitable for a corresponding model search. We obtain an explicit search algorithm for one of them and provide a model search example for the other.
p. 680698
Received: 27 April 2011; in revised form: 25 August 2011 / Accepted: 30 August 2011 / Published: 16 September 2011
Show/Hide Abstract
 PDF Fulltext (251 KB)
Abstract: This article proves that formal theories of evidential favoring must fail because they are inevitably language dependent. I begin by describing Carnap’s early confirmation theories to show how language dependence problems (like Goodman’s grue problem) arise. I then generalize to showthat any formal favoring theory satisfying minimal plausible conditions will yield different judgments about the same evidence and hypothesis when they are expressed in alternate languages. This does not just indict formal theories of favoring; it also shows that something beyond our evidence must be invoked to substantively favor one hypothesis over another.
Select/unselect all
Displaying article 116
Export citation of selected articles as:
Plain Text
BibTeX
BibTeX (without abstracts)
Endnote
Endnote (without abstracts)
Tabdelimited
PubMed XML
DOAJ XML
AGRIS XML