English
Related papers

Related papers: On Mappings on the Hypercube with Small Average St…

200 papers

The Shi arrangement ${\mathcal S}_n$ is the arrangement of affine hyperplanes in ${\mathbb R}^n$ of the form $x_i - x_j = 0$ or $1$, for $1 \leq i < j \leq n$. It dissects ${\mathbb R}^n$ into $(n+1)^{n-1}$ regions, as was first proved by…

Combinatorics · Mathematics 2016-09-07 Christos A. Athanasiadis , Svante Linusson

The pressure function $P(A, s)$ plays a fundamental role in the calculation of the dimension of "typical" self-affine sets, where $A=(A_1,\ldots, A_k)$ is the family of linear mappings in the corresponding generating iterated function…

Dynamical Systems · Mathematics 2015-11-06 De-Jun Feng , Pablo Shmerkin

We prove that any graph $G$ with $n$ points has a distribution $\mathcal{T}$ over spanning trees such that for any edge $(u,v)$ the expected stretch $E_{T \sim \mathcal{T}}[d_T(u,v)/d_G(u,v)]$ is bounded by $\tilde{O}(\log n)$. Our result…

Data Structures and Algorithms · Computer Science 2008-08-15 Ittai Abraham , Yair Bartal , Ofer Neiman

We study the singularity (multifractal) spectrum of the convex hull of the typical/generic continuous functions defined on $[0,1]^{d}$. We denote by ${\mathbf E}_ { { \varphi } }^{h} $ the set of points at which $ \varphi : [0,1]^d\to…

Classical Analysis and ODEs · Mathematics 2016-04-26 Zoltan Buczolich

For all $n,\phi\in \mathbb{N}$ with $\phi\geqslant n+1$, the smallest possible isoperimetric quotient of an $n$-dimensional convex polytope that has $\phi$ facets is shown to be bounded from above and from below by positive universal…

Metric Geometry · Mathematics 2025-09-18 Keith Ball , Károly J. Böröczky , Assaf Naor

We consider diffusion on discrete measure spaces as encoded by Markovian semigroups arising from weighted graphs. We study whether the graph is uniquely determined if the diffusion is given up to order isomorphism. If the graph is recurrent…

Functional Analysis · Mathematics 2014-05-14 Matthias Keller , Daniel Lenz , Marcel Schmidt , Melchior Wirth

Let $\Pi_q$ be an arbitrary finite projective plane of order $q$. A subset $S$ of its points is called saturating if any point outside $S$ is collinear with a pair of points from $S$. Applying probabilistic tools we improve the upper bound…

Combinatorics · Mathematics 2017-11-28 Zoltán Lóránt Nagy

Succinct representations of a graph have been objects of central study in computer science for decades. In this paper, we study the operation called \emph{Distance Preserving Graph Contractions}, which was introduced by Bernstein et al.…

Computational Complexity · Computer Science 2019-12-03 Siddhartha Jain

Given a persistence diagram with $n$ points, we give an algorithm that produces a sequence of $n$ persistence diagrams converging in bottleneck distance to the input diagram, the $i$th of which has $i$ distinct (weighted) points and is a…

Computational Geometry · Computer Science 2020-12-04 Donald R. Sheehy , Siddharth Sheth

We show that the average size of self-avoiding polygons (SAP) with a fixed knot is much larger than that of no topological constraint if the excluded volume is small and the number of segments is large. We call it topological swelling. We…

Soft Condensed Matter · Physics 2018-01-17 Erica Uehara , Tetsuo Deguchi

We extend so-called slit-slide-sew bijections to constellations and quasiconstellations. We present an involution on the set of hypermaps given with an orientation, one distinguished corner, and one distinguished edge leading away from the…

Combinatorics · Mathematics 2025-12-08 Jérémie Bettinelli , Dimitri Korkotashvili

We give the first quasipolynomial upper bound $\phi n^{\text{polylog}(n)}$ for the smoothed complexity of the SWAP algorithm for local Graph Partitioning (also known as Bisection Width), where $n$ is the number of nodes in the graph and…

Data Structures and Algorithms · Computer Science 2023-05-26 Xi Chen , Chenghao Guo , Emmanouil-Vasileios Vlatakis-Gkaragkounis , Mihalis Yannakakis

We consider the asymmetric simple exclusion process (TASEP) on open network consisting of three consecutively coupled macroscopic chain segments with a shortcut between the tail of the first segment and the head of the third one. The model…

Biological Physics · Physics 2015-06-18 Nadezhda Bunzarova , Nina Pesheva , Jordan Brankov

We discuss asymptotics for large random planar maps under the assumption that the distribution of the degree of a typical face is in the domain of attraction of a stable distribution with index $\alpha\in(1,2)$. When the number $n$ of…

Probability · Mathematics 2017-08-23 Jean-François Le Gall , Grégory Miermont

This article presents unified bijective constructions for planar maps, with control on the face degrees and on the girth. Recall that the girth is the length of the smallest cycle, so that maps of girth at least $d=1,2,3$ are respectively…

Combinatorics · Mathematics 2012-06-13 Olivier Bernardi , Eric Fusy

In previous work, the first author, Ghioca, and the third author introduced a broad dynamical framework giving rise to many classical sequences from number theory and algebraic combinatorics. Specifically, these are sequences of the form…

Number Theory · Mathematics 2021-02-24 Jason P. Bell , Fei Hu , Matthew Satriano

In the 1960's, Birch proved that the traces of Frobenius for elliptic curves taken at random over a large finite field is modeled by the semicircular distribution (i.e. the usual Sato-Tate for non-CM elliptic curves). In analogy with…

Number Theory · Mathematics 2022-07-05 Hasan Saad

We present coincidence and common fixed point results of selfmappings satisfying a contraction type in partially ordered metric spaces. As an application, we give an existence theorem for a common solution of integral equations.

General Topology · Mathematics 2016-11-25 Hassen Aydi

For a Banach space $B$ and for a class $\A$ of its bounded closed retracts, endowed with the Hausdorff metric, we prove that retractions on elements $A \in \A$ can be chosen to depend continuously on $A$, whenever nonconvexity of each $A…

General Topology · Mathematics 2010-04-14 Dušan Repovš , Pavel V. Semenov

Fix a positive integer $N\geq2$. For a real number $x\in[0,1]$ and a digit $i\in\{0, 1,...,N-1\}$, let $\Pi_i(x, n)$ denote the frequency of the digit $i$ among the first $n$ $N$-adic digits of $x$. It is well-known that for a typical (in…

Number Theory · Mathematics 2021-01-20 Anastasios Stylianou