Localizing content in neural networks provides a bridge to understanding the way in which the brain stores and processes information. In this paper, I propose the existence of polytopes in the state space of the hidden layer of feedforward neural networks as vehicles of content. I analyze these geometrical structures from an information-theoretic point of view, invoking mutual information to help define the content stored within them. I establish how this proposal addresses the problem of misclassification and provide a novel (...) solution to the disjunction problem, which hinges on the precise nature of the causal-informational framework for content advocated herein. (shrink)

Let be n events in a probability space, and suppose that we have only partial information about the distribution: The probabilites of the events themselves, and their pair intersections. With this partial information we cannot, usually, deternine the probability of an event B in the algebra generated by the 's, but we can obtain lower and upper bounds. This is done by a linear program related to the correlation polytope c(n), a structure introduced in [3], [4]. In the first (...) part of the paper I demonstrate how laws of large numbers (for sequences of events which are not necessarily independent) can be proved, using only the duality theorem of linear programming. These include the weak law of large numbers (necessary and sufficient condition) and various sufficient conditions for strong laws. The connection between these laws and the facet structure of the correlation polytope is established. In the second part of the paper I consider a more general case. Assume that our information consists of the values of the probabilities of all intersections of the 's up to size k, k < n. The techniques of linear programming lead naturally to an application of the theory of polynomial approximation in estimating the size of various events. In particular, I prove an approximate version of the central limit theorem. (shrink)

A connected graph is called Hamilton-connected if there exists a Hamiltonian path between any pair of its vertices. Determining whether a graph is Hamilton-connected is an NP-complete problem. Hamiltonian and Hamilton-connected graphs have diverse applications in computer science and electrical engineering. The detour index of a graph is defined to be the sum of lengths of detours between all the unordered pairs of vertices. The detour index has diverse applications in chemistry. Computing the detour index for a graph is also (...) an NP-complete problem. In this paper, we study the Hamilton-connectivity of convex polytopes. We construct three infinite families of convex polytopes and show that they are Hamilton-connected. An infinite family of non-Hamilton-connected convex polytopes is also constructed, which, in turn, shows that not all convex polytopes are Hamilton-connected. By using Hamilton connectivity of these families of graphs, we compute exact analytical formulas of their detour index. (shrink)

This paper is concerned with techniques for identifying simple and quantified lattice points in 2SAT polytopes. 2SAT polytopes generalize the polyhedra corresponding to Boolean 2SAT formulas, Vertex-Packing and Network flow problems; they find wide application in the domains of Program verification and State-Space search . Our techniques are based on the symbolic elimination strategy called the Fourier-Motzkin elimination procedure and thus have the advantages of being extremely simple and incremental. We also provide a characterization of a 2SAT polytope in (...) terms of its extreme points and derive some interesting hardness results for associated optimization problems. Finally, we provide a brief discussion on the maximum size of a subdeterminant of the linear system representing a 2SAT polytope; this parameter plays a vital role in deriving analytical bounds on the size of the search space for checking whether the polyhedron includes a lattice point. (shrink)

Topological indices are of incredible significance in the field of graph theory. Convex polytopes play a significant role both in various branches of mathematics and also in applied areas, most notably in linear programming. We have calculated some topological indices such as atom-bond connectivity index, geometric arithmetic index, K-Banhatti indices, and K-hyper-Banhatti indices and modified K-Banhatti indices from some families of convex polytopes through M-polynomials. The M-polynomials of the graphs provide us with a great help to calculate the topological indices (...) of different structures. (shrink)

It is shown that a fundamental question of revealed preference theory, namely whether the weak axiom of revealed preference (WARP) implies the strong axiom of revealed preference (SARP), can be reduced to a Hamiltonian cycle problem: A set of bundles allows a preference cycle of irreducible length if and only if the convex monotonic hull of these bundles admits a Hamiltonian cycle. This leads to a new proof to show that preference cycles can be of arbitrary length for more than (...) two but not for two commodities. For this, it is shown that a set of bundles satisfying the given condition exists if and only if the dimension of the commodity space is at least three. Preference cycles can be constructed by embedding a cyclic $(L-1)$ -polytope into a facet of a convex monotonic hull in $L$ -space, because cyclic polytopes always admit Hamiltonian cycles. An immediate corollary is that WARP only implies SARP for two commodities. The proof is intuitively appealing as this gives a geometric interpretation of preference cycles. (shrink)

We use Bub's (2016) correlation arrays and Pitowksy's (1989b) correlation polytopes to analyze an experimental setup due to Mermin (1981) for measurements on the singlet state of a pair of spin-12 particles. The class of correlations allowed by quantum mechanics in this setup is represented by an elliptope inscribed in a non-signaling cube. The class of correlations allowed by local hidden-variable theories is represented by a tetrahedron inscribed in this elliptope. We extend this analysis to pairs of particles of arbitrary (...) spin. The class of correlations allowed by quantum mechanics is still represented by the elliptope; the subclass of those allowed by local hidden-variable theories by polyhedra with increasing numbers of vertices and facets that get closer and closer to the elliptope. We use these results to advocate for an interpretation of quantum mechanics like Bub's. Probabilities and expectation values are primary in this interpretation. They are determined by inner products of vectors in Hilbert space. Such vectors do not themselves represent what is real in the quantum world. They encode families of probability distributions over values of different sets of observables. As in classical theory, these values ultimately represent what is real in the quantum world. Hilbert space puts constraints on possible combinations of such values, just as Minkowski space-time puts constraints on possible spatio-temporal constellations of events. Illustrating how generic such constraints are, the equation for the elliptope derived in this paper is a general constraint on correlation coefficients that can be found in older literature on statistics and probability theory. Yule (1896) already stated the constraint. De Finetti (1937) already gave it a geometrical interpretation. (shrink)

Quantum theory is a probabilistic theory that embodies notoriously striking correlations, stronger than any that classical theories allow but not as strong as those of hypothetical ‘super-quantum’ theories. This raises the question ‘Why the quantum?’—whether there is a handful of principles that account for the character of quantum probability. We ask what quantum-logical notions correspond to this investigation. This project isn’t meant to compete with the many beautiful results that information-theoretic approaches have yielded but rather aims to complement that work.

We define a family of ‘no signaling’ bipartite boxes with arbitrary inputs and binary outputs, and with a range of marginal probabilities. The defining correlations are motivated by the Klyachko version of the Kochen-Specker theorem, so we call these boxes Kochen-Specker-Klyachko boxes or, briefly, KS-boxes. The marginals cover a variety of cases, from those that can be simulated classically to the superquantum correlations that saturate the Clauser-Horne-Shimony-Holt inequality, when the KS-box is a generalized PR-box (hence a vertex of the ‘no (...) signaling’ polytope). We show that for certain marginal probabilities a KS-box is classical with respect to nonlocality as measured by the Clauser-Horne-Shimony-Holt correlation, i.e., no better than shared randomness as a resource in simulating a PR-box, even though such KS-boxes cannot be perfectly simulated by classical or quantum resources for all inputs. We comment on the significance of these results for contextuality and nonlocality in ‘no signaling’ theories. (shrink)

In quantum logics, the notions of strong and full order determination and unitality for states on orthomodular posets are well known. These notions are defined for hypergraphs and their state spaces in a consistent manner and the relations between them and to the notions defined for orthomodular posets are discussed. The state space of a hypergraph is a polytope. This polytope is a simplex if and only if every superposition of pure states is a mixture of these same (...) pure states. Isomorphic hypergraphs have convexly isomorphic state spaces. A class of hypergraphs is given whose group of automorphisms is group-isomorphic to the group of convex automorphisms of their state spaces. (shrink)

Inspired by locale theory, we propose “pointfree convex geometry”. We introduce the notion of convexity algebra as a pointfree convexity space. There are two notions of a point for convexity algebra: one is a chain-prime meet-complete filter and the other is a maximal meet-complete filter. In this paper we show the following: the former notion of a point induces a dual equivalence between the category of “spatial” convexity algebras and the category of “sober” convexity spaces as well as a dual (...) adjunction between the category of convexity algebras and the category of convexity spaces; the latter notion of point induces a dual equivalence between the category of “m-spatial” convexity algebras and the category of “m-sober” convexity spaces. We finally argue that the former notion of a point is more useful than the latter one from a category theoretic point of view and that the former notion of a point actually represents a polytope and the latter notion of a point properly represents a point. We also remark on the close relationships between pointfree convex geometry and domain theory. (shrink)

Bell inequalities are derived for any number of observers, any number of alternative setups for each one of them and any number of distinct outcomes for each experiment. It is shown that if a physical system consists of several distant subsystems, and if the results of tests performed on the latter are determined by local variables with objective values, then the joint probabilities for triggering any given set of distant detectors are convex combinations of a finite number of Boolean arrays, (...) whose components are either 0 or 1 according to a simple rule. This convexity property is both necessary and sufficient for the existence of local objective variables. It leads to a simple graphical method which produces a large number of generalized Clauser-Horne inequalities corresponding to the faces of a convex polytope. It is plausible that quantum systems whose density matrix has a positive partial transposition satisfy all these inequalities, and therefore are compatible with local objective variables, even if their quantum properties are essentially non-local. (shrink)

There are strong indications that ancient Egyptian mythology contains knowledge of the nature of space up to higher dimensions and provides ontologic answers to the question about the creation of matter. This article examines the pentagonal interpretation of the myth of Isis and Osiris by comparing the iconographic details with recent findings from the art research project Quantum Cinema, where an interdisciplinary group of digital artists and scientists established a virtual space model for visualizing the usually non-perceivable processes in the (...) microcosm on a Planck scale. At this scale, quantum mechanics applied to space itself leads to a discrete amount of quantum states. For this research, a new geometrical tool proved invaluable: the epitahedron. The double heptahedron named epitahedron (E±), a 3D Penrose kites and darts representation, confines the dodecahedron in many ways and seems to be Plato’s fifth element. It is a 5D space cell, decorated with fragments of circles, which allows to visualize the permutations of symmetry elements within a discrete lattice (Z5). This higher-dimensional configuration is also the appropriate space to create a quantum-mechanical depiction of particles with inherent wave-like character by means of 3D animated geometry. Disguised in a mythological language the same subscendent space structure with the same golden polytope (E±) can be revealed: is this the origin of the concept of aether, the quintessence model which was a basic scientific task for the last 2500 years? (shrink)

It is shown how the 300 rays associated with the antipodal pairs of vertices of a 120-cell (a four-dimensional regular polytope) can be used to give numerous “parity proofs” of the Kochen–Specker theorem ruling out the existence of noncontextual hidden variables theories. The symmetries of the 120-cell are exploited to give a simple construction of its Kochen–Specker diagram, which is exhibited in the form of a “basis table” showing all the orthogonalities between its rays. The basis table consists of (...) 675 bases (a basis being a set of four mutually orthogonal rays), but all the bases can be written down from the few listed in this paper using some simple rules. The basis table is shown to contain a wide variety of parity proofs, ranging from 19 bases (or contexts) at the low end to 41 bases at the high end. Some explicit examples of these proofs are given, and their implications are discussed. (shrink)

This book offers a thorough technical elaboration and philosophical defense of an objectivist informational interpretation of quantum mechanics according to which its novel content is located in its kinematical framework, that is, in how the theory describes systems independently of the specifics of their dynamics. -/- It will be of interest to researchers and students in the philosophy of physics and in theoretical physics with an interest in the foundations of quantum mechanics. Additionally, parts of the book may be used (...) as the basis for courses introducing non-physics majors to quantum mechanics, or for self-study by those outside of the university with an interest in quantum mechanics. (shrink)

While there is an extensive body of literature about the impact of sharing physical space on ethical consumption, and a growing body of literature that addresses the impact of digital technologies on ethical consumption, there is little research on the increasing intersections between the physical and digital realms. This study explores the distinct affordances of physical and digital spaces and how they may work in both complementary and synergistic fashions. Drawing on an ethnographic study of two ethical consumption communities in (...) North London, UK, we explore how ethical consumers navigate and negotiate both physical and digital spaces, taking advantage of such affordances. We develop the notion of chorophilia, or love for physical space, explore digital commitments and synergistic affordances of scaling up, and advance polytopes, which focus on the relationality of digital-physical spaces. Implications and avenues for future research are also discussed. (shrink)

The hendecachoron is an abstract 4-dimensional polytope composed of eleven cells in the form of hemi-icosahedra. This paper tries to foster an understanding of this intriguing object of high symmetry by discussing its construction in bottom-up and top down ways and providing visualization by computer graphics models.

Hardy and Unruh constructed a family of non-maximally entangled states of pairs of particles giving rise to correlations that cannot be accounted for with a local hidden-variable theory. Rather than pointing to violations of some Bell inequality, however, they pointed to apparent clashes with the basic rules of logic. Specifically, they constructed these states and the associated measurement settings in such a way that the outcomes satisfy some conditionals but not an additional one entailed by them. Quantum mechanics avoids the (...) broken ‘if …then …’ arrows in such Hardy–Unruh chains, as we call them, because it cannot simultaneously assign truth values to all conditionals involved. Measurements to determine the truth value of some preclude measurements to determine the truth value of others. Hardy–Unruh chains thus nicely illustrate quantum contextuality: which variables do and do not obtain definite values depends on what measurements we decide to perform. Using a framework inspired by Bub and Pitowsky and developed in our book Understanding Quantum Raffles (co-authored with Michael E. Cuffaro), we construct and analyze Hardy–Unruh chains in terms of fictitious bananas mimicking the behavior of spin-1/2 particles. (shrink)