Related papers: Convex Union Representability and Convex Codes

Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In…

We initiate the theory of real noncommutative (nc) convex sets, the real case of the recent and profound complex theory developed by Davidson and Kennedy. The present paper focuses on the real case of the topics from the first several…

Understanding the relationship between the depth of a neural network and its representational capacity is a central problem in deep learning theory. In this work, we develop a geometric framework to analyze the expressivity of ReLU networks…

In this paper we consider convex co-compact subgroups of the projective linear group. We prove that such a group is relatively hyperbolic with respect to a collection of virtually Abelian subgroups of rank two if and only if each open face…

Theta representations appear globally as the residues of Eisenstein series on covers of groups; their unramified local constituents may be characterized as subquotients of certain principal series. A cuspidal theta representation is one…

This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restrictions: the cap's faces are quadrilaterals, with vertices…

We deploy algebraic complexity theoretic techniques for constructing symmetric determinantal representations of for00504925mulas and weakly skew circuits. Our representations produce matrices of much smaller dimensions than those given in…

In this paper we deal with the feasibility-seeking problem for unions of convex sets (UCS) sets and propose an iterative process for its solution. Renewed interest in this problem stems from the fact that it was recently discovered to serve…

Very recently Richter and Rogers proved that any convex geometry can be represented by a family of convex polygons in the plane. We shall generalize their construction and obtain a wide variety of convex shapes for representing convex…

A Latin hypercuboid of order $n$ is a $d$-dimensional matrix of dimensions $n\times n\times\cdots\times n\times k$, with symbols from a set of cardinality $n$ such that each symbol occurs at most once in each axis-parallel line. If $k=n$…

The hereditary property of convexity and starlikeness for conformal mappings does not generalize to univalent harmonic mappings. This failure leads us to the notion of fully starlike and convex mappings of order \alpha, (0\leq \alpha<1). A…

For a Euclidean building $X$ of type $A_{2}$, we classify the 0-dimensional subbuildings $A$ of $\partial_{T}X$ that occur as the asymptotic boundary of closed convex subsets. In particular, we show that triviality of the holonomy of a…

We develop a topological approach to prove the generalized Lax conjecture using the fact that determinants of sufficiently big symmetric linear pencils are able to express the rigidly convex sets of RZ polynomials of any degree $d$.…

For a simplicial complex $X$, the $d$-clique complex $\Delta_d(X)$ is the simplicial complex having all subsets of vertices whose $(d + 1)$-subsets are contained by $X$ as its faces. We prove that if $p = n^{\alpha}$, with $\alpha <…

The convex hulls of face-vertex incident vectors of 3-face-colorable convex polytopes are computed. It is found that every such convex hull is a $d$-polytope with $d+2$ or $d+3$ vertices. Utilizing Gale transform and Gale diagram, we…

We introduce the notion of a bicollapsible 2-complex. This allows us to generalize the hyperbolicity of one-relator groups with torsion to a broader class of groups with presentations whose relators are proper powers. We also prove that…

We show the irreducibility of some unitary representations of the group of symplectomorphisms and the group of contactomorphisms.

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…

We consider neural networks with a single hidden layer and non-decreasing homogeneous activa-tion functions like the rectified linear units. By letting the number of hidden units grow unbounded and using classical non-Euclidean…

The problem of minimizing a (nonconvex) quadratic form over the unit simplex, referred to as a standard quadratic program, admits an exact convex conic formulation over the computationally intractable cone of completely positive matrices.…