相关论文: Valleyless Sequences
We study proportions of consecutive occurrences of permutations of a given size. Specifically, the feasible limits of such proportions on large permutations form a region, called feasible region. We show that this feasible region is a…
Given a sequence composed of a limit number of characters, we try to "read" it as a "text". This involves to segment the sequence into "words". The difficulty is to distinguish good segmentation from enormous number of random ones.Aiming at…
Given a one-dimensional shift $X$, let $|F_X(\ell)|$ be the number of follower sets of words of length $\ell$ in $X$. We call the sequence $\{|F_X(\ell)|\}_{\ell \in \mathbb{N}}$ the follower set sequence of the shift $X$. Extender sets are…
Periodicity is often studied in timeseries modelling with autoregressive methods but is less popular in the kernel literature, particularly for higher dimensional problems such as in textures, crystallography, and quantum mechanics. Large…
We propose \emph{Euler Mean Flows (EMF)}, a flow-based generative framework for one-step and few-step generation that enforces long-range trajectory consistency with minimal sampling cost. The key idea of EMF is to replace the trajectory…
A linear forest is a collection of vertex-disjoint paths. The Linear Arboricity Conjecture states that every graph of maximum degree $\Delta$ can be decomposed into at most $\lceil(\Delta+1)/2\rceil$ linear forests. We prove that $\Delta/2…
The precise analysis of the variance of the profile of a suffix tree has been a longstanding open problem. We analyze three regimes of the asymptotic growth of the variance of the profile of a suffix tree built from a randomly generated…
We define the \emph{occurrence graph} $G_p(\pi$) of a pattern $p$ in a permutation $\pi$ as the graph with the occurrences of $p$ in $\pi$ as vertices and edges between the vertices if the occurrences differ by exactly one element. We then…
We prove that the class of permutations generated by passing an ordered sequence $12\dots n$ through a stack of depth 2 and an infinite stack in series is in bijection with an unambiguous context-free language, where a permutation of length…
A (d-parameter) basic nilsequence is a sequence of the form \psi(n)=f(a^{n}x), n \in Z^{d}, where x is a point of a compact nilmanifold X, a is a translation on X, and f is a continuous function on X; a nilsequence is a uniform limit of…
The recently developed theory of extended generating functions of symplectic maps are combined with methods to prove invertibility via high-order Taylor model methods to obtain rigorous lower bounds for the domains of definition of…
We review two novel techniques used to calculate tree-level scattering amplitudes efficiently: MHV diagrams, and on-shell recursion relations. For the MHV diagrams, we consider applications to tree-level amplitudes and focus in particular…
We investigate the structure of trees that have minimal algebraic connectivity among all trees with a given degree sequence. We show that such trees are caterpillars and that the vertex degrees are non-decreasing on every path on…
We give recurrences, generating functions and explicit exact expressions for the enumeration of fundamental quantities involving runs in binary strings. We first focus on enumerations concerning runs of ones, and we then analyse the same…
In this paper we consider wildly ramified power series, \emph{i.e.}, power series defined over a field of positive characteristic, fixing the origin, where it is tangent to the identity. In this setting we introduce a new invariant under…
We provide a partial answer to the following problem: \emph{give an effective upper bound on the multiplicity of non-isolated common zero of a tuple of Noetherian functions}. More precisely, consider a foliation defined by two commuting…
We study joint distributions of cycles and patterns in permutations written in standard cycle form. We explore both classical and generalised patterns of length 2 and 3. Many extensions of classical theory are achieved; bivariate generating…
We introduce a model for random chain complexes over a finite field. The randomness in our complex comes from choosing the entries in the matrices that represent the boundary maps uniformly over $\mathbb{F}_q$, conditioned on ensuring that…
In this paper, we study a maximization problem on real sequences. More precisely, for a given sequence, we are interested in computing the supremum of the sequence and an index for which the associated term is maximal. We propose a general…
A permutation $\sigma$ describing the relative orders of the first $n$ iterates of a point $x$ under a self-map $f$ of the interval $I=[0,1]$ is called an \emph{order pattern}. For fixed $f$ and $n$, measuring the points $x\in I$ (according…