Related papers: Neighborliness of Marginal Polytopes
For a Kan complex with a vertex, we have the notion of its simplicial homotopy groups. In this paper, for a weak complicial set in the sense of Verity with a vertex, we construct monoids which are a generalization of simplicial homotopy…
The distance reducing property for Markov bases is an important property that provides a bound on the mixing time of the associated Markov chain. The goal of this project is to understand properties of distance-reducing Markov bases. We…
For a topologically complete space $X$ and a family of closed covers $\mathcal A$ of $X$ satisfying a "local refinement condition" and a "completeness condition," we give a construction of an inverse system $\mathbf{ N}_{\mathcal A}$ of…
In this paper we show that a simplicial complex can be determined uniquely up to isomorphism by its barycentric subdivision or comparability graph. At the end, it is summarized several algebraic, combinatorial and topological invariants of…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. We deal with the connectivity of the graphs of cubical polytopes. We first establish that, for any $d\ge 3$, the graph of a cubical $d$-polytope…
We find and describe unexpected isomorphisms between two very different objects associated to hypersurface singularities. One object is the Milnor algebra of a function, while the other object associated to a singularity is the local ring…
Our work is concerned with simplicial complexes that describe higher-order interactions in real complex systems. This description allows to go beyond the pairwise node-to-node representation that simple networks provide and to capture a…
There are a large number of theorems detailing the homological properties of the Stanley--Reisner ring of a simplicial complex. Here we attempt to generalize some of these results to the case of a simplicial poset. By investigating the…
We consider methods for aggregating preferences that are based on the resolution of discrete optimization problems. The preferences are represented by arbitrary binary relations (possibly weighted) or incomplete paired comparison matrices.…
Every regular polytope has the remarkable property that it inherits all symmetries of each of its facets. This property distinguishes a natural class of polytopes which are called hereditary. Regular polytopes are by definition hereditary,…
The m-sophistication of a finite binary string x is introduced as a generalization of some parameter in the proof that complexity of complexity is rare. A probabilistic near sufficient statistic of x is given which length is upper bounded…
We introduce some analogues of the Markov spectrum defined in terms of modular billiards and consider the problem of characterizing that part of the spectrum below the lowest limit point.
A complete set of N+1 mutually unbiased bases (MUBs) forms a convex polytope in the N^2-1 dimensional space of NxN Hermitian matrices of unit trace. As a geometrical object such a polytope exists for all values of N, while it is unknown…
We construct a model structure on the category of ordered simplicial complexes, Quillen equivalent to the standard model structure on simplicial sets. This shows that simplicial complexes, which are fully combinatorial in nature, provide a…
The paper extends Birkhoff's theorem on doubly stochastic matrices to some countable families of discrete probability spaces with nonempty intersections. We join every two elements lying in the same probability space by an edge and…
Inference in Bayesian statistics involves the evaluation of marginal likelihood integrals. We present algebraic algorithms for computing such integrals exactly for discrete data of small sample size. Our methods apply to both uniform priors…
The covering type of a space $X$ is defined as the minimal cardinality of a good cover of a space that is homotopy equivalent to $X$. We derive estimates for the covering type of $X$ in terms of other invariants of $X$, namely the ranks of…
We present a general procedure to construct examples of convex scalar variational problems which admit a minimizers with large singular sets. The dimension of the set of singularities is maximal and the minimizer has no higher integrability…
The exact computation of the nearest-neighbor spacing distribution P(s) is performed for a rectangular billiard with point-like scatterer inside for periodic and Dirichlet boundary conditions and it is demonstrated that for large s this…
We determine when a quasi-isometry between discrete spaces is at bounded distance from a bilipschitz map. From this we prove a geometric version of the Von Neumann conjecture on amenability. We also get some examples in geometric groups…