English
Related papers

Related papers: Loops with exponent three in all isotopes

200 papers

We investigate the minimum number of cycles of specified lengths in planar $n$-vertex triangulations $G$. It is proven that this number is $\Omega(n)$ for any cycle length at most $3 + \max \{ {\rm rad}(G^*), \lceil…

Combinatorics · Mathematics 2025-06-13 On-Hei Solomon Lo , Carol T. Zamfirescu

Littlewood asked for the maximum number $N$ of congruent infinite cylinders that can be arranged in $\mathbb{R}^3$ so that every pair touches. We improve upon the proof of the second author that $N \leq 18$ to show that $N \leq 10$.…

Combinatorics · Mathematics 2025-10-07 Travis Dillon , Junnosuke Koizumi , Sammy Luo

We consider maximum packings of edge-disjoint $4$-cliques in the complete graph $K_n$. When $n \equiv 1$ or $4 \pmod{12}$, these are simply block designs. In other congruence classes, there are necessarily uncovered edges; we examine the…

Combinatorics · Mathematics 2019-05-30 Yanxun Chang , Peter J. Dukes , Tao Feng

In 1782, Euler conjectured that no Latin square of order $n\equiv 2\; \textrm{mod}\; 4$ has a decomposition into transversals. While confirmed for $n=6$ by Tarry in 1900, Bose, Parker, and Shrikhande constructed counterexamples in 1960 for…

Combinatorics · Mathematics 2025-01-10 Candida Bowtell , Richard Montgomery

Let $G$ be a finite group and let $ram^{t}(G)$ denote the minimal positive integer $n$ such that $G$ can be realized as the Galois group of a tamely ramified extension of $\mathbb{Q}$ ramified only at $n$ finite primes. Let $d(G)$ denote…

Number Theory · Mathematics 2016-11-15 Daniel Rabayev

Let $T(n)$ denote the maximal number of transversals in an order-$n$ Latin square. Improving on the bounds obtained by McKay et al., Taranenko recently proved that $T(n) \leq \left((1+o(1))\frac{n}{e^2}\right)^{n}$, and conjectured that…

Combinatorics · Mathematics 2015-06-03 Roman Glebov , Zur Luria

The aim of the inverse Galois problem is to find extensions of a given field whose Galois group is isomorphic to a given group. In this article, we are interested in subgroups of GL(2,Z/nZ) where n is an integer. We know that, in general,…

Number Theory · Mathematics 2023-10-11 Zoé Yvon

We prove that with high probability $\mathbb{G}^{(3)}(n,n^{-1+o(1)})$ contains a spanning Steiner triple system for $n\equiv 1,3\pmod{6}$, establishing the exponent for the threshold probability for existence of a Steiner triple system. We…

Combinatorics · Mathematics 2022-05-04 Ashwin Sah , Mehtaab Sawhney , Michael Simkin

We consider the problem of finding integer triangles with $R/r$ a positive rational, where $R$ and $r$ are the radii of the circumcircle and an excircle, respectively. We show that for general triangles $R/r>1/4$ applies. The equation…

Number Theory · Mathematics 2025-12-18 Lorenz Halbeisen , Norbert Hungerbühler , Arman Shamsi Zargar

We prove that any subset $A \subseteq [3]^n$ with $3^{-n}|A| \ge (\log\log\log\log n)^{-c}$ contains a combinatorial line of length $3$, i.e., $x, y, z \in A$, not all equal, with $x_i=y_i=z_i$ or $(x_i,y_i,z_i)=(0,1,2)$ for all $i = 1, 2,…

Combinatorics · Mathematics 2024-11-25 Amey Bhangale , Subhash Khot , Yang P. Liu , Dor Minzer

Robin's criterion states that the Riemann Hypothesis (RH) is true if and only if Robin's inequality $\sigma(n):=\sum_{p|n}p<e^{\gamma} n \log \log n$ is satisfied for $n > 5040$, where $\gamma$ denotes the Euler-Mascheroni constant. We show…

Number Theory · Mathematics 2018-08-21 Alexander Hertlein

This is part of a series of papers describing the new curve integral formalism for scattering amplitudes of the colored scalar tr$\phi^3$ theory. We show that the curve integral manifests a very surprising fact about these amplitudes: the…

High Energy Physics - Theory · Physics 2024-10-01 Nima Arkani-Hamed , Hadleigh Frost , Giulio Salvatori , Pierre-Guy Plamondon , Hugh Thomas

How often is a quintic polynomial solvable by radicals? We establish that the number of such polynomials, monic and irreducible with integer coefficients in $[-H,H]$, is $O(H^{3.91})$. More generally, we show that if $n \ge 3$ and $n \notin…

Number Theory · Mathematics 2023-02-01 Sam Chow , Rainer Dietmann

Let $F_1,\dotsc,F_R$ be quadratic forms with integer coefficients in $n$ variables. When $n\geq 9R$ and the variety $V(F_1,\dotsc,F_R)$ is a smooth complete intersection, we prove an asymptotic formula for the number of integer points in an…

Number Theory · Mathematics 2022-06-22 Simon L. Rydin Myerson

We show that the loop $O(n)$ model on the hexagonal lattice exhibits exponential decay of loop sizes whenever $n> 1$ and $x<\tfrac{1}{\sqrt{3}}+\varepsilon(n)$, for some suitable choice of $\varepsilon(n)>0$. It is expected that, for $n…

Probability · Mathematics 2019-01-11 Alexander Glazman , Ioan Manolescu

We classify all sets of nonzero vectors in $\mathbb{R}^3$ such that the angle formed by each pair is a rational multiple of $\pi$. The special case of four-element subsets lets us classify all tetrahedra whose dihedral angles are multiples…

Metric Geometry · Mathematics 2020-12-01 Kiran S. Kedlaya , Alexander Kolpakov , Bjorn Poonen , Michael Rubinstein

We prove the covering radius of the third-order Reed-Muller code RM(3,7) is 20, which was previously known to be between 20 and 23 (inclusive). The covering radius of RM(3, 7) is the maximum third-order nonlinearity among all 7-variable…

Information Theory · Computer Science 2023-01-18 Jinjie Gao , Haibin Kan , Yuan Li , Qichun Wang

Let $S$ be a set of $n$ points in $\mathbb{R}^3$, no three collinear and not all coplanar. If at most $n-k$ are coplanar and $n$ is sufficiently large, the total number of planes determined is at least $1 + k…

Combinatorics · Mathematics 2010-10-12 George B. Purdy , Justin W. Smith

In the classical theory, a famous by-product of the continued fraction expansion of quadratic irrational numbers $\sqrt{D}$ is the solution to Pell's equation for $D$. It is well-known that, once an integer solution to Pell's equation…

Number Theory · Mathematics 2021-01-29 Nikoleta Kalaydzhieva

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Combinatorics · Mathematics 2016-11-22 Bernardo Abrego , Silvia Fernandez-Merchant , Daniel J. Katz , Levon Kolesnikov