English
Related papers

Related papers: Three Generalizations of Davenport-Schinzel Sequen…

200 papers

We consider the distribution of the length of the longest subsequence avoiding a given pattern in a random permutation of length n. The well-studied case of a longest increasing subsequence corresponds to avoiding the pattern 21. We show…

Combinatorics · Mathematics 2007-05-23 Michael H. Albert

For positive integers $s,t,m$ and $n$, the Zarankiewicz number $z(m,n;s,t)$ is the maximum number of edges in a subgraph of $K_{m,n}$ that has no complete bipartite subgraph containing $s$ vertices in the part of size $m$ and $t$ vertices…

Combinatorics · Mathematics 2025-12-16 Sara Davies , Peter Gill , Daniel Horsley

We study nonstationary intermittent dynamical systems, such as compositions of a (deterministic) sequence of Pomeau-Manneville maps. We prove two main results: sharp bounds on memory loss, including the "unexpected" faster rate for a large…

Dynamical Systems · Mathematics 2021-04-21 Alexey Korepanov , Juho Leppänen

In this paper we extend some classical results valid for canonical multiplicative cascades to exact scaling log-infinitely divisible cascades. We complete previous results on non-degeneracy and moments of positive orders obtained by Barral…

Probability · Mathematics 2012-08-13 Julien Barral , Xiong Jin

An inversion sequence of length $n$ is an integer sequence $e=e_{1}e_{2}\dots e_{n}$ such that $0\leq e_{i}<i$ for each $i$. Corteel--Martinez--Savage--Weselcouch and Mansour--Shattuck began the study of patterns in inversion sequences,…

Combinatorics · Mathematics 2023-06-22 Juan S. Auli , Sergi Elizalde

Inversion sequences of length $n$, $\mathbf{I}_n$, are integer sequences $(e_1, \ldots, e_n)$ with $0 \leq e_i < n$ for each $i$. The study of patterns in inversion sequences was initiated recently by Mansour-Shattuck and…

Combinatorics · Mathematics 2018-01-09 Megan A. Martinez , Carla D. Savage

The aim of this paper is to provide complementary quantitative extensions of two results of H.S. Shapiro on the time-frequency concentration of orthonormal sequences in $L^2 (\R)$. More precisely, Shapiro proved that if the elements of an…

Classical Analysis and ODEs · Mathematics 2007-07-11 Philippe Jaming , Alexander M. Powell

The enumeration of inversion sequences avoiding a single pattern was initiated by Corteel--Martinez--Savage--Weselcouch and Mansour--Shattuck independently. Their work has sparked various investigations of generalized patterns in inversion…

Combinatorics · Mathematics 2023-06-22 Chunyan Yan , Zhicong Lin

Gravitational effective theories are essential for characterizing the space of deviations from General Relativity (GR). Testing these theories against fundamental principles, such as causality and unitarity, can yield constraints on the…

High Energy Physics - Theory · Physics 2026-04-09 Alexander Cassem , Mark P. Hertzberg

Motivated in part by various sequences of graphs growing under random rules (like internet models), convergent sequences of dense graphs and their limits were introduced by Borgs, Chayes, Lov\'asz, S\'os and Vesztergombi and by Lov\'asz and…

Combinatorics · Mathematics 2009-05-26 C. Borgs , J. Chayes , L. Lovász , V. T. Sós , K. Vesztergombi

In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered…

Discrete Mathematics · Computer Science 2009-07-16 Craig Weidert

In this paper, we present new high-probability PAC-Bayes bounds for different types of losses. Firstly, for losses with a bounded range, we recover a strengthened version of Catoni's bound that holds uniformly for all parameter values. This…

Machine Learning · Statistics 2024-06-05 Borja Rodríguez-Gálvez , Ragnar Thobaben , Mikael Skoglund

We study Schr\"odinger equations on $\mathbb{Z}^d$ and $\mathbb{R}^d$, $d\geq 2$ with random potentials of strength $\lambda$. Our main result gives tail bounds for the terms of the Dyson series that are effective at time scales on the…

Mathematical Physics · Physics 2025-02-05 Adam Black , Reuben Drogin , Felipe Hernández

Let $S_n$ denote the set of permutations of $[n]$ and let $\sigma=\sigma_1\cdots\sigma_n\in S_n$. For a subsequence $\{\sigma_{i_j}\}_{j=1}^k$ of $\{\sigma_i\}_{i=1}^n$ of length $k\ge2$, construct the ``up/down'' sequence $V_1\cdots…

Combinatorics · Mathematics 2024-12-05 Ross G. Pinsky

The paper investigates recoverability of sequences from their periodic subsequences and offers some modification of the approach suggested in papers arXiv:1605.00414 and arXiv:1803.02233. It is shown that there exists a class of sequences…

Information Theory · Computer Science 2018-03-21 Nikolai Dokuchaev

For a set of positive integers $D$, a $k$-term $D$-diffsequence is a sequence of positive integers $a_1<a_2<\cdots<a_k$ such that $a_i-a_{i-1}\in D$ for $i=2,3,\cdots,k$. For $k\in\mathbb{Z}^+$ and $D\subset \mathbb{Z}^+$, we define…

Combinatorics · Mathematics 2022-12-07 Alexander Clifton

For $X(n)$ a Steinhaus random multiplicative function, we study the maximal size of the random Dirichlet polynomial $$ D_N(t) = \frac1{\sqrt{N}} \sum_{n \leq N} X(n) n^{it}, $$ with $t$ in various ranges. In particular, for fixed $C>0$ and…

Number Theory · Mathematics 2023-02-24 Jacques Benatar , Alon Nishry

Let $D: \mathbb{Z}_m^n \to \mathbb{Z}_m^n$ be defined so \[D(x_1, x_2, ..., x_n)=(x_1+x_2 \; \text{mod} \; m, x_2+x_3 \; \text{mod} \; m, ..., x_n+x_1 \; \text{mod} \; m).\] $D$ is known as the Ducci function and for $\mathbf{u} \in…

Number Theory · Mathematics 2024-10-25 Mark L. Lewis , Shannon M. Tefft

We study a generalization of Erd\H os's unit distances problem to chains of $k$ distances. Given $\mathcal P,$ a set of $n$ points, and a sequence of distances $(\delta_1,\ldots,\delta_k)$, we study the maximum possible number of tuples of…

Combinatorics · Mathematics 2019-02-25 Eyvindur Ari Palsson , Steven Senger , Adam Sheffer

Let $G$ be an additive finite abelian group. A sequence over $G$ is called a minimal zero-sum sequence if the sum of its terms is zero and no proper subsequence has this property. Davenport's constant of $G$ is the maximum of the lengths of…

Number Theory · Mathematics 2010-01-14 Wolfgang A. Schmid
‹ Prev 1 8 9 10 Next ›