English
Related papers

Related papers: Counting multijoints

200 papers

We stratify the $\mathrm{SL}_3$ big cell Kloosterman sets using the reduced word decomposition of the Weyl group element, inspired by the Bott-Samelson factorization. Thus the $\mathrm{SL}_3$ long word Kloosterman sum is decomposed into…

Number Theory · Mathematics 2020-01-08 Eren Mehmet Kıral , Maki Nakasuji

We completely describe the structure of the connected components of transversals to a collection of n line segments in R^3. We show that n>2 arbitrary line segments in R^3 admit 0, 1, ..., n or infinitely many line transversals. In the…

Metric Geometry · Mathematics 2010-03-29 Hervé Brönnimann , Hazel Everett , Sylvain Lazard , Frank Sottile , Sue Whitesides

We study 3-random-like graphs, that is, sequences of graphs in which the densities of triangles and anti-triangles converge to 1/8. Since the random graph ${\mathcal G}_{n,1/2}$ is, in particular, 3-random-like, this can be viewed as a weak…

Combinatorics · Mathematics 2019-02-20 Dan Hefetz , Mykhaylo Tyomkyn

The area of judicious partitioning considers the general family of partitioning problems in which one seeks to optimize several parameters simultaneously, and these problems have been widely studied in various combinatorial contexts. In…

Combinatorics · Mathematics 2014-10-07 Choongbum Lee , Po-Shen Loh , Benny Sudakov

We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…

Combinatorics · Mathematics 2025-10-31 Dominique Maldague , Hong Wang , Dmitrii Zakharov

We prove that for any set $F$ of $n\ge 2$ pairwise disjoint open convex sets in $\mathbb{R}^3$, the connected components of the set of lines intersecting every member of $F$ are contractible. The same result holds for directed lines.

Metric Geometry · Mathematics 2024-09-06 Otfried Cheong , Xavier Goaoc , Andreas F. Holmsen

We provide a technique to obtain explicit bounds for problems that can be reduced to linear forms in three complex logarithms of algebraic numbers. This technique can produce bounds significantly better than general results on lower bounds…

Number Theory · Mathematics 2023-10-02 Maurice Mignotte , Paul Voutier

We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…

Computational Geometry · Computer Science 2008-06-12 Timothy G. Abbott , Zachary Abel , David Charlton , Erik D. Demaine , Martin L. Demaine , Scott D. Kominers

We extend the classical Lebesgue and Fubini differentiation theorems to functions of several variables, using the notions of joint derivative and joint monotonicity. Our first main result shows that for a function $f$ of bounded variation,…

Functional Analysis · Mathematics 2025-10-21 Xianrui Zhang

Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…

Combinatorics · Mathematics 2024-09-16 Swee Hong Chan , Igor Pak

We study the gordian graph of all knots in $\R^3$: two knots are adjacent if they differ by a single crossing change. We prove that this graph contains isometrically an infinite countable tree with infinite valency, and that the complement…

Geometric Topology · Mathematics 2007-05-23 Julien Marche

The cut number of a manifold M, c(M), is the largest number of disjoint two-sided hypersurfaces in M which do not separate M. Equivalently, it is the largest rank of a free group being an epimorphic image of pi_1(M). We investigate the…

Geometric Topology · Mathematics 2015-05-27 Adam S. Sikora

Let $\F_q$ ($q=p^r$) be a finite field. In this paper the number of irreducible polynomials of degree $m$ in $\F_q[x]$ with prescribed trace and norm coefficients is calculated in certain special cases and a general bound for that number is…

Number Theory · Mathematics 2015-05-13 Marko Moisio

We prove that every end of a graph contains either uncountably many disjoint rays or a set of disjoint rays that meet all rays of the end and start at any prescribed feasible set of start vertices. This confirms a conjecture of…

Combinatorics · Mathematics 2017-04-24 J. Pascal Gollin , Karl Heuer

This manuscript introduces $J_3$-numbers, a seemingly missing three-dimensional intermediate between complex numbers related to points in the Cartesian coordinate plane and Hamilton's quaternions in the 4D space. The current development is…

General Mathematics · Mathematics 2015-09-07 Shlomo Jacobi

Given $(V_1,V_2)$ a Heegaard splitting of the complement of a composite knot $K=K_1# K_2$ in $S^3$, where $K_i, i=1,2$ are prime knots, we have a unique, up to isotopy, decomposing annulus $A$. When the intersection of $A$ and $V_1$ is a…

Geometric Topology · Mathematics 2007-05-23 Yoav Moriah

For each vector $x\in \ell^{\infty}$, we can define the non-empty compact set $L_x$ of accumulation points of $x$. Given an infinite subset $A$ of $\mathbb{N}\backslash\{1\}$, we can therefore investigate under which conditions on $A$, the…

Functional Analysis · Mathematics 2023-03-08 Quentin Menet , Dimitris Papathanasiou

We extend known results on the number of solutions to a linear equation in at least three prime numbers when the primes involved are required to lie in specified Chebotarev classes. We prove asymptotic results similar to previous ones only…

Number Theory · Mathematics 2012-11-07 Daniel M. Kane

If two closed Jordan curves in the plane have precisely one point in common, then it is called a {\em touching point}. All other intersection points are called {\em crossing points}. The main result of this paper is a Crossing Lemma for…

Combinatorics · Mathematics 2015-07-08 János Pach , Natan Rubin , Gábor Tardos

We give bounds on the number of non-simple closed curves on a negatively curved surface, given upper bounds on both length and self-intersection number. In particular, it was previously known that the number of all closed curves of length…

Geometric Topology · Mathematics 2017-02-21 Jenya Sapir