English
Related papers

Related papers: Gap Sequence of Cutting Sequence with Slope $\thet…

200 papers

The cutoff phenomenon describes a sharp transition in the convergence of a family of ergodic finite Markov chains to equilibrium. Many natural families of chains are believed to exhibit cutoff, and yet establishing this fact is often…

Probability · Mathematics 2019-12-19 Eyal Lubetzky , Allan Sly

The response to a local strong non-magnetic impurity in the pseudogap phase is examined in two distinctly different scenarios: phase-fluctuation (PF) of pairing field and d-density-wave (DDW) order. In the PF scenario, the resonance state…

Superconductivity · Physics 2009-11-07 Qiang-Hua Wang

Given a graph $G$ and $p\in [0,1]$, the random subgraph $G_p$ is obtained by retaining each edge of $G$ independently with probability $p$. We show that for every $\epsilon>0$, there exists a constant $C>0$ such that the following holds.…

Combinatorics · Mathematics 2024-07-24 Sahar Diskin , Joshua Erde , Mihyun Kang , Michael Krivelevich

Let $G$ be an infinite, vertex-transitive lattice with degree $\lambda$ and fix a vertex on it. Consider all cycles of length exactly $l$ from this vertex to itself on $G$. Erasing loops chronologically from these cycles, what is the…

Combinatorics · Mathematics 2021-04-22 P. -L. Giscard

This paper introduces the \emph{$d$-distance matching problem}, in which we are given a bipartite graph $G=(S,T;E)$ with $S=\{s_1,\dots,s_n\}$, a weight function on the edges and an integer $d\in\mathbb Z_+$. The goal is to find a maximum…

Combinatorics · Mathematics 2023-01-24 Péter Madarasi

This paper deals with the variational analysis, for every $s \in (0,1)$ and $p \in [1,+\infty)$, of $(s,p)$-Gagliardo seminorms in a periodic setting. First, we consider the space of $L^p$, $T$-periodic functions and define the energy…

Functional Analysis · Mathematics 2026-04-30 G. Pini , F. Santilli

In this note, we explore two families of sequences associated to a suitable integer sequence: the gap-sum sequence and the gap-product sequence. These are the sums and the products of consecutive numbers not in the original sequence. We…

Combinatorics · Mathematics 2021-04-13 Paul Barry

A sequence $Z$ in the complex plane $\C$ is called a zero sequence for the Fock space $F^p_\alpha$ if there exists a function $f\in F^p_\alpha$, not identically zero, such that $Z$ is the zero set of $f$, counting multiplicities. We show…

Complex Variables · Mathematics 2011-10-12 Kehe Zhu

We study a random walk on the Lie algebra $\mathfrak{sl}_2(\mathbf{F}_p)$ where new elements are produced by randomly applying adjoint operators of two generators. Focusing on the generic case where the generators are selected at random, we…

Rings and Algebras · Mathematics 2025-12-12 Urban Jezernik , Matevž Miščič

A computational problem exhibits a "gap property" when there is no tractable boundary between two disjoint sets of instances. We establish a Gap Trichotomy Theorem for a family of constraint problem variants, completely classifying the…

Computational Complexity · Computer Science 2017-03-28 Lucy Ham

Golomb's sequence is the unique nondecreasing sequence of positive integers in which each $n$ appears exactly $a(n)$ times. It satisfies the global self-referential rule \[ a\bigl(a(n)+a(n-1)+\cdots+a(1)\bigr)=n, \] grows smoothly like a…

Number Theory · Mathematics 2026-04-06 Benoit Cloitre

The complexity function of an infinite word $w$ on a finite alphabet $A$ is the sequence counting, for each non-negative $n$, the number of words of length $n$ on the alphabet $A$ that are factors of the infinite word $w$. The goal of this…

Dynamical Systems · Mathematics 2018-02-26 Carlos Gustavo Moreira , Christian Mauduit

We establish the spectral gap property for dense subgroups of $SU(d)$ ($d\geq 2$), generated by finitely many elements with algebraic entries; this result was announced in [BG3]. The method of proof differs, in several crucial aspects, from…

Group Theory · Mathematics 2011-09-01 Jean Bourgain , Alex Gamburd

We prove the existence of a ternary sequence of factor complexity $2n+1$ for any given vector of rationally independent letter frequencies. Such sequences are constructed from an infinite product of two substitutions according to a…

Combinatorics · Mathematics 2021-02-25 Julien Cassaigne , Sébastien Labbé , Julien Leroy

Ne\v{s}et\v{r}il and Ossona de Mendez recently proposed a new definition of graph convergence called structural convergence. The structural convergence framework is based on the probability of satisfaction of logical formulas from a fixed…

Combinatorics · Mathematics 2023-09-07 David Hartman , Tomáš Hons , Jaroslav Nešetřil

We study the model $G_\alpha\cup G(n,p)$ of randomly perturbed dense graphs, where $G_\alpha$ is any $n$-vertex graph with minimum degree at least $\alpha n$ and $G(n,p)$ is the binomial random graph. We introduce a general approach for…

Combinatorics · Mathematics 2019-08-01 Julia Böttcher , Richard Montgomery , Olaf Parczyk , Yury Person

We examine the complexity of the online Dictionary Matching with One Gap Problem (DMOG) which is the following. Preprocess a dictionary $D$ of $d$ patterns, where each pattern contains a special gap symbol that can match any string, so that…

Data Structures and Algorithms · Computer Science 2015-07-13 Amihood Amir , Tsvi Kopelowitz , Avivit Levy , Seth Pettie , Ely Porat , B. Riva Shalom

The main question studied in this paper concerns the weak-coupling behavior of the geometrically induced bound states of singular Schr\"odinger operators with an attractive $\delta$ interaction supported by a planar, asymptotically straight…

Mathematical Physics · Physics 2019-12-10 Pavel Exner , Sylwia Kondej

A factor graph of a point process is a graph whose vertices are the points of the process, and which is constructed from the process in a deterministic isometry-invariant way. We prove that the d-dimensional Poisson process has a one-ended…

Probability · Mathematics 2007-05-23 Alexander E. Holroyd , Yuval Peres

A celebrated result of Otter says the number of distinct unlabelled spanning trees in $K_n$ is $\alpha^n$ up to subexponential factors for an absolute constant $\alpha>0$. In this note, we prove that for every $0<\varepsilon<\alpha$, there…

Combinatorics · Mathematics 2026-05-14 Yiting Wang