Related papers: Asymptotic Pairs for Interval Exchange Transformat…
We derive the low-temperature large-distance asymptotics of the transversal two-point functions of the XXZ chain by summing up the asymptotically dominant terms of their expansion into form factors of the quantum transfer matrix. Our…
We prove conditional asymptotic normality of a class of quadratic U-statistics that are dominated by their degenerate second order part and have kernels that change with the number of observations. These statistics arise in the construction…
An interval translation map (ITM) is a piece-wise translation $T \colon I \to I$ defined on a finite partition $I_1, \ldots, I_r$ of an interval $I$ into $r \ge 2$ subintervals. In contrast to classical interval exchange transformations…
In this work we employ a simple pairing interaction model in order to study and classify an eventual pairing phase transition in finite fermionic systems. We show that systems with as few as 10-16 fermions can exhibit clear features…
We study various aspects of periodic points for random substitution subshifts. In order to do so, we introduce a new property for random substitutions called the disjoint images condition. We provide a procedure for determining the property…
We derive a nonparametric higher-order asymptotic expansion for small-time changes of conditional characteristic functions of It\^o semimartingale increments. The asymptotics setup is of joint type: both the length of the time interval of…
Asymptotic representation of minimal polynomials on several intervals is given. The last modifications and corrections of this manuscript were done by the author in the two months preceding his passing away in November 2009. The manuscript…
We study the asymptotic behavior of Multiple Meixner polynomials of first and second kind, respectively (see J. Arves\'u et al. J. Comput. Appl. Math., 153, (2003)). We use an algebraic function formulation for the solution of the…
The prefix exchange distance of a permutation is the minimum number of exchanges involving the leftmost element that sorts the permutation. We give new combinatorial proofs of known results on the distribution of the prefix exchange…
For an interval exchange map, the number of discontinuities of its iterates either exhibits linear growth or is bounded. This dichotomy is used to prove that the group of interval exchanges does not contain distortion elements, giving…
Generalized interval exchange transformations (GIETs) are semi-conjugate to interval exchange transformations (IETs) when the Rauzy-Veech combinatorics is $\infty$-complete. When this semi-conjugacy is a homeomorphism, a fundamental problem…
We prove, under mild conditions on fixed points and two cycles, the asymptotic normality of vincular pattern counts for a permutation chosen uniformly at random in a conjugacy class.Additionally, we prove that the limiting variance is…
Doppler shift formulas are derived for two less studied scenarios: stationary receiver and source in harmonic oscillatory motion and stationary receiver and source in uniform circular motion. For each of the scenarios we derive a formula,…
In this note we essentially simplify the proof of the main result in one paper from leading computer science conference 25th ACM Symposium on Parallelism in Algorithms and Architectures (see [3].) We also present direct method and give…
This paper aims to better understand the link better understand the links between aperiodicity in subshifts and pattern complexity. Our main contribution deals with substitutive subshifts, an equivalent to substitutive tilings in the…
A theorem about asymptotic estimation of multiple integral of a special type is proved for the case when the integrand peaks at the integration domain bound, but not at a point of extremum. Using this theorem the asymptotic expansion of the…
The aim of this article is to prove asymptotic shape theorems for the contact process in stationary random environment. These theorems generalize known results for the classical contact process. In particular, if H_t denotes the set of…
It is proved that almost every interval exchange transformation given by the symmetric permutation 1->m, 2->m-1,..., m-1->2, m->1, where m>1 is an odd number, is disjoint from ELF systems. The notion of ELF systems was introduced to express…
Classical two-sample permutation tests for equality of distributions have exact size in finite samples, but they fail to control size for testing equality of parameters that summarize each distribution. This paper proposes permutation tests…
Recurrence quantification analysis is a method for measuring the complexity of dynamical systems. Recurrence determinism is a fundamental characteristic of it, closely related to correlation sum. In this paper, we study asymptotic behavior…