English
Related papers

Related papers: Permutations minimizing the number of collinear tr…

200 papers

We prove that a weak $\mathbb{Q}$-Fano $3$-fold with terminal singularities has unobstructed deformations. By using this result and computing some invariants of a terminal singularity, we provide two results on global deformation of a weak…

Algebraic Geometry · Mathematics 2017-09-12 Taro Sano

We prove that the theory of the Farey graph is pseudofinite by constructing a sequence of finite structures that satisfy increasingly large subsets of its first-order axiomatization. This graph is an important object in the study of curve…

Logic · Mathematics 2026-03-26 Connor Martinez Lockhart

The Sylvester-Gallai theorem states that for a finite set of points in the plane, if every line determined by any two of these points also contains a third, then the set is necessarily made of collinear points. In this paper, we first…

Combinatorics · Mathematics 2025-12-17 Imre Barany , Julia Q. Du , Dan Schwarz , Liping Yuan , Tudor Zamfirescu

In this work, we consider a finitely determined, quasihomogeneous, corank 1 map germ $f$ from $(\mathbb{C}^2,0)$ to $(\mathbb{C}^3,0)$. We introduce the concept of the $\mu_{\mathbf{m},\mathbf{k}}$-minimal transverse slice of $f$}. Since…

Algebraic Geometry · Mathematics 2025-10-14 Otoniel Nogueira da Silva , Manoel Messias da Silva Júnior

We show that finding orthogonal grid-embeddings of plane graphs (planar with fixed combinatorial embedding) with the minimum number of bends in the so-called Kandinsky model (which allows vertices of degree $> 4$) is NP-complete, thus…

Computational Geometry · Computer Science 2014-05-12 Thomas Bläsius , Guido Brückner , Ignaz Rutter

In 1988 Rafla conjectured that every simple drawing of a complete graph $K_n$ contains a plane, i.e., non-crossing, Hamiltonian cycle. The conjecture is far from being resolved. The lower bounds for plane paths and plane matchings have…

Computational Geometry · Computer Science 2023-05-17 Helena Bergold , Stefan Felsner , Meghana M. Reddy , Manfred Scheucher

In a 2022, Bartoli, Cossidente, Marino, and Pavese proved that in the projective space ${\rm PG}(3,q^3)$, one can find three $\mathbb F_q$-subgeometries such that the union of their point sets is a strong blocking set. This proves the…

Combinatorics · Mathematics 2025-11-20 Sam Adriaensen , Peter Sziklai , Zsuzsa Weiner

We introduce a new ``Winding Number Conjecture'' about maps from the $(d-1)$-skeleton of the $((d+1)(q-1))$-simplex into $\real^d$. This conjecture is equivalent to the Topological Tverberg Theorem. Furthermore, many statements about the…

Combinatorics · Mathematics 2007-05-23 Torsten Schöneborn

The minimal degeneration singularities in the affine Grassmannians of simple simply-laced algebraic groups are determined to be either Kleinian singularities of type A, or closures of minimal orbits in nilpotent cones. The singularities for…

Algebraic Geometry · Mathematics 2007-05-23 Anton Malkin , Viktor Ostrik , Maxim Vybornov

A Kakeya set is a subset of F^n, where F is a finite field of q elements, that contains a line in every direction. In this paper we show that the size of every Kakeya set is at least C_n * q^n, where C_n depends only on n. This improves the…

Combinatorics · Mathematics 2015-05-13 Zeev Dvir

We provide an affirmative answer to a variant of the Busemann-Petty problem, proposed by V.~Milman: Let $K$ be a convex body in ${\mathbb R}^n$ and let $D$ be a compact subset of ${\mathbb R}^n$ such that, for some $1\ls k\ls n-1$,…

Metric Geometry · Mathematics 2016-01-19 Apostolos Giannopoulos , Alexander Koldobsky

The Multiplicity Conjecture is a deep problem relating the multiplicity (or degree) of a Cohen-Macaulay standard graded algebra with certain extremal graded Betti numbers in its minimal free resolution. In the case of level algebras of…

Commutative Algebra · Mathematics 2008-04-10 Juan C. Migliore , Uwe Nagel , Fabrizio Zanello

We give a lower bound for the size of a subset of $\mathbb F_q^n$ containing a rich k-plane in every direction, a k-plane Furstenberg set. The chief novelty of our method is that we use arguments on non-reduced subschemes and flat families…

Algebraic Geometry · Mathematics 2016-10-05 Jordan S. Ellenberg , Daniel Erman

We study three classical graph problems - Hamiltonian path, minimum spanning tree, and minimum perfect matching on geometric graphs induced by bichromatic (red and blue) points. These problems have been widely studied for points in the…

Computational Geometry · Computer Science 2022-07-19 Sayan Bandyapadhyay , Aritra Banik , Sujoy Bhore , Martin Nöllenburg

In this note we prove that almost cap sets $A \subset \mathbb{F}_q^n$, i.e., the subsets of $\mathbb{F}_q^n$ that do not contain too many arithmetic progressions of length three, satisfy that $|A| < c_q^n$ for some $c_q < q$. As a corollary…

Number Theory · Mathematics 2021-02-24 Alexander Fish , Dibyendu Roy

We show how for every integer n one can explicitly construct n distinct plane quartics and one hyperelliptic curve over the complex numbers all of whose Jacobians are isomorphic to one another as abelian varieties without polarization. When…

Algebraic Geometry · Mathematics 2007-05-23 Everett W. Howe

We show that if a finite point set $P\subseteq \mathbb{R}^2$ has the fewest congruence classes of triangles possible, up to a constant $M$, then at least one of the following holds. (1) There is a $\sigma>0$ and a line $l$ which contains…

Combinatorics · Mathematics 2023-10-25 Sam Mansfield , Jonathan Passant

We study monomial ideals with linear presentation or partially linear resolution. We give combinatorial characterizations of linear presentation for square-free ideals of degree 3, and for primary ideals whose resolutions are linear except…

Commutative Algebra · Mathematics 2022-04-01 Hailong Dao , David Eisenbud

Billey, Jockusch, and Stanley characterized 321-avoiding permutations by a property of their reduced decompositions. This paper generalizes that result with a detailed study of permutations via their reduced decompositions and the notion of…

Combinatorics · Mathematics 2007-05-23 Bridget Eileen Tenner

We apply Fourier analysis on finite groups to obtain simplified formulations for the Lov\'asz theta-number of a Cayley graph. We put these formulations to use by checking a few cases of a conjecture of Ellis, Friedgut, and Pilpel made in a…

Optimization and Control · Mathematics 2014-06-19 Evan DeCorte , David de Laat , Frank Vallentin
‹ Prev 1 4 5 6 7 8 10 Next ›