Related papers: Blaschke and Separation Theorems for Orthogonally …
In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…
Quantum states that remain separable (i.e., not entangled) under any global unitary transformation are known as absolutely separable and form a convex set. Despite extensive efforts, the complete characterization of this set remains largely…
F. Wehrung has asked: Given a family $\mathcal{C}$ of subsets of a set $\Omega$, under what conditions will there exist a total ordering on $\Omega$ under which every member of $\mathcal{C}$ is convex? <p> Note that if $A$ and $B$ are…
New identities on traces of representations of the Hecke algebra on the spaces of paths on graphs are presented. These identities are relevant in the computation of partition functions with fixed boundary conditions and of two-point…
Here is an example of a plane set of vanishing area and consisting of line-segments whose directions cover an angle : let E be a Cantor set of dissection ratio 1/4 (therefore dimension 1/2) carried by the horizontal axis and E' the image of…
We study the algebraic boundary of a convex semi-algebraic set via duality in convex and algebraic geometry. We generalize the correspondence of facets of a polytope to the vertices of the dual polytope to general semi-algebraic convex…
Optimizing an implicational base of a closure system consists in turning this implicational base into an equivalent one with premises and conclusions as small as possible. This task is known to be hard in general but tractable for a number…
We present a framework to obtain valid inequalities for a reverse convex set: the set of points in a polyhedron that lie outside a given open convex set. Reverse convex sets arise in many models, including bilevel optimization and…
Barycentric coordinates provide solutions to the problem of expressing an element of a compact convex set as a convex combination of a finite number of extreme points of the set. They have been studied widely within the geometric…
We investigate the regularity of the marginals onto hyperplanes for sets of finite perimeter. We prove, in particular, that if a set of finite perimeter has log-concave marginals onto a.e. hyperplane then the set is convex.
A detailed combinatorial analysis of planar lattice convex polygonal lines is presented. This makes it possible to answer an open question of Vershik regarding the existence of a limit shape when the number of vertices is constrained. The…
This paper continues the investigation of staircases in the family of Hirzebruch surfaces formed by blowing up the projective plane with weight b, that was started in Bertozzi, Holm et al. in arXiv:2010.08567. We explain the symmetries…
An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…
This paper is devoted to a study of mathematical structures arising from choice functions satisfying the path independence property (Plott functions). We broaden the notion of a choice function by allowing of empty choice. This enables us…
High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to spherical, Euclidean and…
It is conjectured that if a finite set of points in the plane contains many collinear triples then there is some structure in the set. We are going to show that under some combinatorial conditions such pointsets contain special…
Given experimental data, one of the main objectives of biological modeling is to construct a model which best represents the real world phenomena. In some cases, there could be multiple distinct models exhibiting the exact same dynamics,…
One important class of tools in the study of the connections between algebraic and topological structures are the "Banach-Stone type theorems", which describe algebraic isomorphisms of algebras (or groups, lattices, etc.) of functions in…
Considering systems of separations in a graph that separate every pair of a given set of vertex sets that are themselves not separated by these separations, we determine conditions under which such a separation system contains a nested…
We are concerned with two separation theorems about analytic sets by Dyck and Preiss, the former involves the positively-defined subsets of the Cantor space and the latter the Borel-convex subsets of finite dimensional Banach spaces. We…