Related papers: Planar convex codes are decidable

The aim of this article is to show the existence, and also give an explicit construction, of infinite sets of orthogonal exponentials for certain families of convex polytopes which include simple-rational polytopes and also non simple…

We construct partitions of rectangles into smaller rectangles from an input consisting of a planar dual graph of the layout together with restrictions on the orientations of edges and junctions of the layout. Such an orientation-constrained…

Let P be a polygon with rational vertices in the plane. We show that for any finite odd-sized collection of translates of P, the area of the set of points lying in an odd number of these translates is bounded away from 0 by a constant…

Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…

We prove the existence of subspace designs with any given parameters, provided that the dimension of the underlying space is sufficiently large in terms of the other parameters of the design and satisfies the obvious necessary divisibility…

The problem of classifying the convex pentagons that admit tilings of the plane is a long-standing unsolved problem. Previous to this article, there were 14 known distinct kinds of convex pentagons that admit tilings of the plane. Five of…

The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…

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…

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…

We introduce moment maps for continuous unitary representations of general topological groups. For solvable separable locally compact groups, we prove that the closure of the image of the moment map of any representation is convex.

Convex neural codes are combinatorial structures describing the intersection pattern of a collection of convex sets. Inductively pierced codes are a particularly nice subclass of neural codes introduced in the information visualization…

Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Towards this goal, for graphs that are minimally rigid in the plane, we take advantage of a recently published algorithm, which is the…

We shown that every continuous local functional on the space of finite convex functions on $\mathbb{R}^n$ is a valuation. This relation is used to establish a homogeneous decomposition for the class of polynomial local functionals as well…

In this paper we study the set of projective maps between compact proper convex real projective manifolds. We show that this set contains only finitely many distinct homotopy classes and each homotopy class has the structure of a real…

Given a set of radii measured from a fixed point, the existence of a convex configuration with respect to the set of distinct radii in the two-dimensional case is proved when radii are distinct or repeated at most four points. However, we…

We show that a group admits a planar, finitely generated Cayley graph if and only if it admits a special kind of group presentation we introduce, called a planar presentation. Planar presentations can be recognised algorithmically. As a…

Let $K$ be a convex pentagon in the plane and let $K_1$ be the pentagon bounded by the diagonals of $K$. It has been conjectured that the maximum of the ratio between the areas of $K_1$ and $K$ is reached when $K$ is an affine regular…

Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints…

An internal or friendly partition of a vertex set $V(G)$ of a graph $G$ is a partition to two nonempty sets $A\cup B$ such that every vertex has at least as many neighbours in its own class as in the other one. Motivated by Diwan's…

Effective bounds for the finite number of surjective holomorphic maps between canonically polarized compact complex manifolds of any dimension with fixed domain are proven. Both the case of a fixed target and the case of varying targets are…