English
Related papers

Related papers: Binary scalar products

200 papers

Let $d \geq 3$ be a natural number. We show that for all finite, non-empty sets $A \subseteq \mathbb{R}^d$ that are not contained in a translate of a hyperplane, we have \[ |A-A| \geq (2d-2)|A| - O_d(|A|^{1- \delta}),\] where $\delta >0$ is…

Combinatorics · Mathematics 2023-06-22 Akshat Mudgal

We prove that there is an absolute constant $ C$ such that for every $ n \geq 2 $ and $ N\geq 10^n, $ there exists a polytope $ P_{n,N} \subset \mathbb{R}^n $ with at most $ N $ facets that satisfies…

Probability · Mathematics 2020-03-02 Gil Kur

We classify the d-dimensional simplicial, terminal, and reflexive polytopes with at least 3d-2 vertices. In particular, it turns out that these are all smooth Fano polytopes. This improves on previous results of Casagrande in 2006 and Oebro…

Algebraic Geometry · Mathematics 2015-07-31 Benjamin Assarf , Michael Joswig , Andreas Paffenholz

It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…

Combinatorics · Mathematics 2018-11-28 Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

We show that for every $d$-dimensional polytope, the hypergraph whose nodes are $k$-faces and whose hyperedges are $(k+1)$-faces of the polytope is strongly $(d-k)$-vertex connected, for each $0 \leq k \leq d- 1$.

Combinatorics · Mathematics 2021-07-21 Daniel Hathcock , Josephine Yu

Given a (finite) simplicial complex, we define its $i$-th Laplacian polytope as the convex hull of the columns of its $i$-th Laplacian matrix. This extends Laplacian simplices of finite simple graphs, as introduced by Braun and Meyer. After…

Combinatorics · Mathematics 2023-02-06 Martina Juhnke-Kubitzke , Daniel Köhne

We study the interaction between two structures on the group of polynomial automorphisms of the affine plane: its structure as an amalgamated free product and as an infinite-dimensional algebraic variety. We introduce a new conjecture, and…

Algebraic Geometry · Mathematics 2018-09-27 Drew Lewis , Kaitlyn Perry , Armin Straub

In this paper we present an explicit combinatorial description of a special class of facets of the secondary polytopes of hypersimplices. These facets correspond to polytopal subdivisions called multi-splits. We show a relation between the…

Combinatorics · Mathematics 2019-10-10 Benjamin Schröter

A bipartite graph $G = (X \cup Y, E)$ is a 2-layer $k$-planar graph if it admits a drawing on the plane such that the vertices in $X$ and $Y$ are placed on two parallel lines respectively, edges are drawn as straight-line segments, and…

Discrete Mathematics · Computer Science 2026-02-20 Yuto Okada

Let $d>k$ be positive integers. Motivated by an earlier result of Bugeaud and Nguyen, we let $E_{k,d}$ be the set of $(c_1,\ldots,c_k)\in\mathbb{R}_{\geq 0}^k$ such that…

Number Theory · Mathematics 2024-08-02 Seda Albayrak , Samprit Ghosh , Greg Knapp , Khoa D. Nguyen

We prove the following theorem, which is related to McMullen's problem on projective transformations of polytopes; let $2\leq k\leq \lfloor{\frac{d}{2}}\rfloor$ and $\nu{(d, k)}$ be the largest number such that any set of $\nu{(d,k)}$…

Combinatorics · Mathematics 2013-03-18 Natalia Garcia-Colin , David Larman

Let $F$ be a non-singular homogeneous polynomial of degree $d$ in $n$ variables. We give an asymptotic formula of the pairs of integer points $(\mathbf x, \mathbf y)$ with $|\mathbf x| \le X$ and $|\mathbf y| \le Y$ which generate a line…

Number Theory · Mathematics 2020-08-21 Julia Brandes

In [{Structural properties and decomposition of linear balanced matrices}, {\it Mathematical Programming}, 55:129--168, 1992], Conforti and Rao conjectured that every balanced bipartite graph contains an edge that is not the unique chord of…

With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out that those polytopes generalize several well-known polytopes…

Combinatorics · Mathematics 2024-04-10 Jonas Frede , Volker Kaibel , Maximilian Merkert

We prove a common generalization to several mass partition results using hyperplane arrangements to split $\mathbb{R}^d$ into two sets. Our main result implies the ham-sandwich theorem, the necklace splitting theorem for two thieves, a…

Combinatorics · Mathematics 2024-04-30 Alfredo Hubard , Pablo Soberón

Dualising the construction of a polyhedral product, we introduce the notion of a polyhedral coproduct as a certain homotopy limit over the face poset of a simplicial complex. We begin a study of the basic properties of polyhedral…

Algebraic Topology · Mathematics 2025-06-04 Steven Amelotte , William Hornslien , Lewis Stanton

Among the set of hypersurfaces of degree $d$ and dimension $\ell$ defined by the vanishing of a homogeneous polynomial with coefficients $\pm 1$, we investigate the probability that a hypersurface contains a rational point as $d$ and $\ell$…

Number Theory · Mathematics 2025-10-31 Tim Browning , Will Sawin

Let $P$ be a convex $d$-polytope and $0 \leq k \leq d-1$. In 2023, this author proved the following inequalities, resolving a question of B\'ar\'any: \[ \frac{f_k(P)}{f_0(P)} \geq \frac{1}{2}\biggl[{\lceil \frac{d}{2} \rceil \choose k} +…

Combinatorics · Mathematics 2024-01-30 Joshua Hinman

The purpose of this paper is to identify all of the Cayley-Dickson doubling products. A Cayley-Dickson algebra $\mathbb{A}_{N+1}$ of dimension $2^{N+1}$ consists of all ordered pairs of elements of a Cayley-Dickson algebra $\mathbb{A}_{N}$…

Rings and Algebras · Mathematics 2023-08-30 John W. Bales

A well-known conjecture of McMullen, proved by Billera, Lee and Stanley, describes the face numbers of simple polytopes. The necessary and sufficient condition is that the toric g-vector of the polytope is an M-vector, that is, the vector…

Combinatorics · Mathematics 2014-12-19 Kalle Karu
‹ Prev 1 3 4 5 6 7 10 Next ›