English
Related papers

Related papers: Perpendicular dissections of space

200 papers

Let $(P,E)$ be a $(d+1)$-uniform geometric hypergraph, where $P$ is an $n$-point set in general position in $\mathbb{R}^d$ and $E\subseteq {P\choose d+1}$ is a collection of $\epsilon{n\choose d+1}$ $d$-dimensional simplices with vertices…

Combinatorics · Mathematics 2024-03-04 Natan Rubin

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

An embedding of the complete bipartite graph $K_{3,3}$ in $\mathbb{P}^2$ gives rise to both a line arrangement and a bar-and-joint framework. For a generic placement of the six vertices, the graded Betti numbers of the logarithmic module of…

Commutative Algebra · Mathematics 2023-06-12 Michael DiPasquale , Jessica Sidman , Will Traves

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

Discrete Mathematics · Computer Science 2013-08-29 Alexander Grigoriev , Athanassios Koutsonas , Dimitrios M. Thilikos

The vanishing ideal I of a subspace arrangement is an intersection of linear ideals. We give a formula for the Hilbert polynomial of I if the subspaces meet transversally. We also give a formula for the Hilbert series of a product J of the…

Commutative Algebra · Mathematics 2007-05-23 Harm Derksen

We study the undirected divisibility graph in which the vertex set is a finite subset of consecutive natural numbers up to N.We derive analytical expressions for measures of the graph like degree, clustering, geodesic distance and…

Combinatorics · Mathematics 2020-10-26 R. Abiya , G. Ambika

Intersecting codes are linear codes where every two nonzero codewords have non-trivially intersecting support. In this article we expand on the theory of this family of codes, by showing that nondegenerate intersecting codes correspond to…

Combinatorics · Mathematics 2024-06-07 Martino Borello , Wolfgang Schmid , Martin Scotti

In this paper we study intersections of quadrics, components of the hypersurface in Grassmannian $Gr(3, \CC^n)$ introduced in \cite{SoSuSi}. This lead to an alternative statement and proof of Pappus's Theorem retrieving Pappus's and Hesse…

Algebraic Geometry · Mathematics 2018-02-27 S. Sawada , S. Settepanella , S. Yamagata

We study percolation problems of overlapping objects where the underlying geometry is such that in D-dimensions, a subset of the directions has a lattice structure, while the remaining directions have a continuum structure. The resulting…

Statistical Mechanics · Physics 2025-01-13 Jasna C. K , V. Krishnadev , V. Sasidevan

Let $n,k$ denote integers with $n>2k\geq 6$. Let $\mathbb{F}_q$ denote a finite field with $q$ elements, and let $V$ denote a vector space over $\mathbb{F}_q$ that has dimension $n$. The projective geometry $P_q(n)$ is the partially ordered…

Combinatorics · Mathematics 2024-08-02 Ian Seong

Consider a finite collection of affine hyperplanes in $\mathbb R^d$. The hyperplanes dissect $\mathbb R^d$ into finitely many polyhedral chambers. For a point $x\in \mathbb R^d$ and a chamber $P$ the metric projection of $x$ onto $P$ is the…

Metric Geometry · Mathematics 2020-09-02 Zakhar Kabluchko

We study several models of random geometric subdivisions arising from the model of Diaconis and Miclo (2011). In particular, we show that the limiting shape of an indefinite subdivision of a quadrilateral is a.s.\ a parallelogram. We also…

Probability · Mathematics 2011-12-06 Stanislav Volkov

A basis of the ideal of the complement of a linear subspace in a projective space over a finite field is given. As an application, the second largest number of points of plane curves of degree $d$ over the finite field of $q$ elements is…

Algebraic Geometry · Mathematics 2015-09-09 Masaaki Homma , Seon Jeong Kim

We generalise the existence of combinatorial designs to the setting of subset sums in lattices with coordinates indexed by labelled faces of simplicial complexes. This general framework includes the problem of decomposing hypergraphs with…

Combinatorics · Mathematics 2018-02-19 Peter Keevash

We compute the essential dimension of the functors Forms_{n,d} and Hypersurf_{n, d} of equivalence classes of homogeneous polynomials in n variables and hypersurfaces in P^{n-1}, respectively, over any base field k of characteristic 0. Here…

Algebraic Geometry · Mathematics 2017-02-22 Zinovy Reichstein , Angelo Vistoli

Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…

Computational Geometry · Computer Science 2007-05-23 Rolf Klein , Martin Kutz

We study the algebraic hyperbolicity of the complement of very general degree $2n$ hypersurfaces in P^n. We prove the Algebraic Green-Griffiths-Lang Conjecture for these complements, and in the case of the complement of a quartic plane…

Algebraic Geometry · Mathematics 2023-10-31 Xi Chen , Eric Riedl , Wern Yeong

We compute some numerical invariants of the lines on hyperplane sections of a smooth cubic threefold over complex numbers. We also prove that for any smooth hypersurface $X\subset \mathbb P^{n+1}$ of degree $d$ over an algebraically closed…

Algebraic Geometry · Mathematics 2020-07-08 Yiran Cheng

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

Combinatorics · Mathematics 2021-07-01 Imre Ruzsa , Jozsef Solymosi

The (k,d)-hypersimplex is a (d-1)-dimensional polytope whose vertices are the (0,1)-vectors that sum to k. When k=1, we get a simplex whose graph is the complete graph with d vertices. Here we show how many of the well known graph…

Combinatorics · Mathematics 2008-11-19 Fred J. Rispoli