English
Related papers

Related papers: More on additive triples of bijections

200 papers

We show that if a graph $G$ admits a quasi-isometry $\phi$ to a graph $H$ of bounded path-width, then we can assign a non-negative integer length to each edge of $H$, such that the same function $\phi$ is a quasi-isometry to this weighted…

Combinatorics · Mathematics 2025-10-03 Tung Nguyen , Alex Scott , Paul Seymour

The author has already proven that the space $\Delta(\Pi_n)/G$ is homotopy equivalent to a wedge of spheres of dimension $n-3$ for all natural numbers $n\geq 3$ and all subgroups $G\subset S_1\times S_{n-1}$. We construct an $S_1\times…

Algebraic Topology · Mathematics 2020-09-29 Ralf Donau

In this paper we obtain a series of asymptotic formulae in the sum--product phenomena over the prime field $\mathbf{F}_p$. In the proofs we use usual incidence theorems in $\mathbf{F}_p$, as well as the growth result in ${\rm SL}_2…

Number Theory · Mathematics 2018-03-06 Ilya D. Shkredov

Given a positive integer $u$ and a simple algebraic group $G$ defined over an algebraically closed field $K$ of characteristic $p$, we derive properties about the subvariety $G_{[u]}$ of $G$ consisting of elements of $G$ of order dividing…

Group Theory · Mathematics 2017-06-07 Claude Marion

In a recent paper, Ayyer and Behrend present for a wide class of partitions factorizations of Schur polynomials with an even number of variables where half of the variables are the reciprocals of the others into symplectic and/or orthogonal…

Combinatorics · Mathematics 2020-03-31 Arvind Ayyer , Ilse Fischer

We use the resolution of singularities algorithm of [G4] to provide new estimates for exponential sums as well as new bounds on how often a function f(x) such as a polynomial with integer coefficients is divisible by various powers of a…

Classical Analysis and ODEs · Mathematics 2014-12-11 Michael Greenblatt

In this paper, we study the structure of the complete asymptotic expansion of the probability that a large combinatorial object is connected or consists of a given number of connected components. For rapidly growing labeled families of…

Combinatorics · Mathematics 2026-05-26 Thierry Monteil , Khaydar Nurligareev

We establish the asymptotic expansion in $\beta$ matrix models with a confining, off-critical potential, in the regime where the support of the equilibrium measure is a union of segments. We first address the case where the filling…

Mathematical Physics · Physics 2024-07-19 Gaëtan Borot , Alice Guionnet

In this paper we show some multiplicity estimates theorems for a connected algebraic group (not necessarily commutative) $G$ over an algebraically closed subfield of $\mathbb{C}$. More specifically, under particular assumptions on the…

Algebraic Geometry · Mathematics 2015-12-15 Mario Huicochea

In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…

General Mathematics · Mathematics 2026-04-21 Theophilus Agama , Berndt Gensel

This paper continues the study initiated in "The aithmetic of Triangles." We begin by examining a set of similar tetrahedra with parallel sides, together with a set of points in three-dimensional space. It turns out that the set…

General Mathematics · Mathematics 2025-09-18 Edward Mieczkowski

In this paper, we study (random) sequences of pseudo s-th powers, as introduced by Erd\"os and R\'enyi in 1960. In 1975, Goguel proved that such a sequence is almost surely not an asymptotic basis of order s. Our first result asserts that…

Number Theory · Mathematics 2014-07-22 Javier Cilleruelo , Jean-Marc Deshouillers , Victor Lambert , Alain Plagne

We use representation theory of the symmetric group S_n to prove Poisson limit theorems for the distribution of fixed points for three types of non-uniform permutations. First, we give results for the commutator of g and x where g and x are…

Combinatorics · Mathematics 2024-06-28 Jason Fulman

This paper systematically studies the asymptotics of Humbert's bivariate confluent hypergeometric function $\Phi_1[a,b;c;x, y]$. Specifically, we establish explicit asymptotic expansions in five distinct regimes: (i) $x\to\infty$; (ii)…

Classical Analysis and ODEs · Mathematics 2026-02-24 Peng-Cheng Hang , Liangjian Hu , Min-Jie Luo

In this article we establish the arithmetic purity of strong approximation for certain semi-simple simply connected $k$-simple linear algebraic groups and their homogeneous spaces over a number field $k$. For instance, for any such group…

Number Theory · Mathematics 2020-08-21 Yang Cao , Zhizhong Huang

We prove the following theorem: Let $\pi$ be the fundamental group of a finite graph of groups with finitely generated vertex groups $G_v$ having asdim $G_v\le n$ for all vertices $v$. Then asdim$\pi\le n+1$. This gives the best possible…

Group Theory · Mathematics 2007-05-23 G. Bell , A. Dranishnikov

We show that there is a bijection between real-linear automorphisms of the multicomplex numbers of order $n$ and signed permutations of length $2^{n-1}$. This allows us to deduce a number of results on the multicomplex numbers, including a…

Rings and Algebras · Mathematics 2022-11-28 Nicolas Doyon , Pierre-Olivier Parisé , William Verreault

The objective of this paper is the study of functions which only act on the digits of an expansion. In particular, we are interested in the asymptotic distribution of the values of these functions. The presented result is an extension and…

Number Theory · Mathematics 2010-10-20 Manfred G. Madritsch , Attila PethHö

We consider a number of combinatorial problems in which rational generating functions may be obtained, whose denominators have factors with certain singularities. Specifically, there exist points near which one of the factors is asymptotic…

Combinatorics · Mathematics 2011-08-12 Yuliy Baryshnikov , Robin Pemantle

We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…

Combinatorics · Mathematics 2013-04-05 Adrian Ocneanu