Related papers: Convex Union Representability and Convex Codes

Consider a convex set S defined by a matrix inequality of polynomials or rational functions over a domain. The set S is called semidefinite programming (SDP) representable or just semidefinite representable if it equals the projection of a…

It plays a fundamental role to compactly represent the visual information towards the optimization of the ultimate utility in myriad visual data centered applications. With numerous approaches proposed to efficiently compress the texture…

Place cells are neurons that act as biological position sensors, associated with and firing in response to regions of an environment to situate an organism in space. These associations are recorded in (combinatorial) neural codes,…

We show that every convex code realizable by compact sets in the plane admits a realization consisting of polygons, and analogously every open convex code in the plane can be realized by interiors of polygons. We give factorial-type bounds…

We present structures comprised of identical convex polyhedra which are interlocked geometrically. These sets cannot be disassembled by removing individual polyhedra by translations and/or rotations. The shapes that permit interlocking…

We investigate the representations and the structure of Hecke algebras associated to certain finite complex reflection groups. We first describe computational methods for the construction of irreducible representations of these algebras,…

Motivated by the separability problem in quantum systems $2\otimes4$, $3\otimes3$ and $2\otimes2\otimes2$, we study the maximal (proper) faces of the convex body, $S_1$, of normalized separable states in an arbitrary quantum system with…

We search for faces of the convex set consisting of all separable states, which are affinely isomorphic to simplices, to get separable states with unique decompositions. In the two-qutrit case, we found that six product vectors spanning a…

We investigate the structure of two-dimensional partial cubes, i.e., of isometric subgraphs of hypercubes whose vertex set defines a set family of VC-dimension at most 2. Equivalently, those are the partial cubes which are not contractible…

The geometric problem of estimating an unknown compact convex set from evaluations of its support function arises in a range of scientific and engineering applications. Traditional approaches typically rely on estimators that minimize the…

A convex polygon is defined as a sequence (V_0,...,V_{n-1}) of points on a plane such that the union of the edges [V_0,V_1],..., [V_{n-2},V_{n-1}], [V_{n-1},V_0] coincides with the boundary of the convex hull of the set of vertices…

Let {\Lnk} be the class of all $n$-dimensional real solvable Lie algebras having $k$-dimensional derived ideals. In 2020 the authors et al. gave a classification of all non 2-step nilpotent Lie algebras of {\Li}. We propose in this paper to…

We classify the irreducible representations of smooth, connected affine algebraic groups over a field, by tackling the case of pseudo-reductive groups. We reduce the problem of calculating the dimension for pseudo-split pseudo-reductive…

Region-specific linear models are widely used in practical applications because of their non-linear but highly interpretable model representations. One of the key challenges in their use is non-convexity in simultaneous optimization of…

For multidimensional Euclidean type spaces, we study convex choice: from any choice set, the set of types that make the same choice is convex. We establish that, in a suitable sense, this property characterizes the sufficiency of local…

The task of this survey is to present various results on intersection patterns of convex sets. One of main tools for studying intersection patterns is a point of view via simplicial complexes. We recall the definitions of so called…

Neural codes are lists of subsets of neurons that fire together. Of particular interest are neurons called place cells, which fire when an animal is in specific, usually convex regions in space. A fundamental question, therefore, is to…

Developing an idea of Kapranov and Voevodsky, we introduce a model of weak omega-categories based on directed complexes, combinatorial presentations of pasting diagrams. We propose this as a convenient framework for higher-dimensional…

In this paper we verify a conjecture by Kozlov (Discrete Comput Geom 18 (1997) 421--431), which describes the convex hull of the set of face vectors of $r$-colorable complexes on $n$ vertices. As part of the proof we derive a generalization…

We study the boundary structure of closed convex cones, with a focus on facially dual complete (nice) cones. These cones form a proper subset of facially exposed convex cones, and they behave well in the context of duality theory for convex…