English
Related papers

Related papers: Counterexamples to the B-spline conjecture for Gab…

200 papers

We say that a set $A$ \emph{$t$-intersects} a set $B$ if $A$ and $B$ have at least $t$ common elements. Two families $\mathcal{A}$ and $\mathcal{B}$ are said to be \emph{cross-$t$-intersecting} if each set in $\mathcal{A}$ $t$-intersects…

Combinatorics · Mathematics 2013-12-12 Peter Borg

Let $f_r(n,v,e)$ denote the maximum number of edges in an $r$-uniform hypergraph on $n$ vertices, in which the union of any $e$ distinct edges contains at least $v+1$ vertices. The study of $f_r(n,v,e)$ was initiated by Brown, Erd{\H{o}}s…

Combinatorics · Mathematics 2020-10-23 Gennian Ge , Chong Shangguan

We study orbits of semigroups of $\text{SL}(2,\mathbb{Z})$, and demonstrate reciprocity obstructions: we show that certain such orbits avoid squares, but not as a consequence of obstructions inherited from an algebraic set, and not as a…

Number Theory · Mathematics 2025-12-24 James Rickards , Katherine E. Stange

We study solutions to the equation $a+b=c$, where $a,b,c$ form a triple of coprime natural numbers. The $abc$ conjecture asserts that, for any $\epsilon>0$, such triples satisfy $\mathrm{rad}(abc) \ge c^{1-\epsilon}$ with finitely many…

Number Theory · Mathematics 2026-05-12 Christian Bernert , Tim Browning , Jared Duker Lichtman , Joni Teräväinen

Seymour conjectured that every oriented simple graph contains a vertex whose second neighborhood is at least as large as its first. In this note, we put forward a conjecture that we prove is actually equivalent: every oriented simple graph…

Combinatorics · Mathematics 2019-04-15 Tyler Seacrest

Let $\mathbb F$ be a real closed field. We define the notion of a maximal framing for a representation of the fundamental group of a surface with values in ${\rm Sp}(2n,\mathbb F)$. We show that ultralimits of maximal representations in…

Group Theory · Mathematics 2018-03-16 Marc Burger , Maria Beatrice Pozzetti

Geometrical objects with integral side lengths have fascinated mathematicians through the ages. We call a set $P=\{p_1,...,p_n\}\subset\mathbb{Z}^2$ a maximal integral point set over $\mathbb{Z}^2$ if all pairwise distances are integral and…

Combinatorics · Mathematics 2008-04-09 Andrey Radoslavov Antonov , Sascha Kurz

We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…

Combinatorics · Mathematics 2019-09-16 Greg Kuperberg , Shachar Lovett , Ron Peled

Heuristics based on the Sato--Tate conjecture suggest that an abelian surface defined over a number field has infinitely many places of split reduction. We prove this result for abelian surfaces having real multiplication. Similar to…

Number Theory · Mathematics 2020-03-18 Ananth N. Shankar , Yunqing Tang

We show that for each $n \geq 2$, the systoles of closed hyperbolic $n$-manifolds form a dense subset of $(0, +\infty)$. We also show that for any $n\geq 2$ and any Salem number $\lambda$, there is a closed arithmetic hyperbolic…

Geometric Topology · Mathematics 2024-11-13 Sami Douba , Junzhi Huang

Menger's theorem tells us that if $S,T$ are sets of vertices in a graph $G$, then (for $k\ge0$) either there are $k+1$ vertex-disjoint paths between $S$ and $T$, or there is a set of $k$ vertices separating $S$ and $T$. But what if we want…

Combinatorics · Mathematics 2025-09-11 Tung Nguyen , Alex Scott , Paul Seymour

Given a finite set satisfying condition $\mathcal{A}$, the subset selection problem asks, how large of a subset satisfying condition $\mathcal{B}$ can we find? We make progress on three instances of subset selection problems in planar point…

Combinatorics · Mathematics 2024-12-20 József Balogh , Felix Christian Clemen , Adrian Dumitrescu , Dingyuan Liu

We investigate the structure of finite sets $A \subseteq \Z$ where $|A+A|$ is large. We present a combinatorial construction that serves as a counterexample to natural conjectures in the pursuit of an "anti-Freiman" theory in additive…

Classical Analysis and ODEs · Mathematics 2011-03-01 Allison Lewko , Mark Lewko

It is conjectured that the dual variety of every smooth nonlinear subvariety of dimension $> \frac{2N}{3}$ in projective $N$-space is a hypersurface, an expectation known as the duality defect conjecture. This would follow from the truth of…

Algebraic Geometry · Mathematics 2020-07-01 Grayson Jorgenson

For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…

General Mathematics · Mathematics 2023-07-31 Mbakiso Fix Mothebe

Let $G=(V,E)$ be a countable graph. The Bunkbed graph of $G$ is the product graph $G \times K_2$, which has vertex set $V\times \{0,1\}$ with "horizontal'' edges inherited from $G$ and additional "vertical'' edges connecting $(w,0)$ and…

Combinatorics · Mathematics 2021-10-04 Tom Hutchcroft , Petar Nizić-Nikolac , Alexander Kent

We develop an obstruction theory for the extension of truncated minimal $A$-infinity bimodule structures over truncated minimal $A$-infinity algebras. Obstructions live in far-away pages of a (truncated) fringed spectral sequence of…

Algebraic Topology · Mathematics 2025-07-24 Gustavo Jasso , Fernando Muro

Let B be a commutative B\'ezout domain B and let MSpec(B) be the maximal spectrum of B. We obtain a Feferman-Vaught type theorem for the class of B-modules. We analyse the definable sets in terms, on one hand, of the definable sets in the…

Logic · Mathematics 2018-06-08 Sonia L'Innocente , Françoise Point

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

A directed graph is oriented if it can be obtained by orienting the edges of a simple, undirected graph. For an oriented graph $G$, let $\beta(G)$ denote the size of a minimum feedback arc set, a smallest subset of edges whose deletion…

Combinatorics · Mathematics 2022-04-20 Jacob Fox , Zoe Himwich , Nitya Mani
‹ Prev 1 4 5 6 7 8 10 Next ›