Related papers: Counting stabilized-interval-free permutations
The SU(3) gauge theory with fermions in the sextet representation is one of several theories of interest for technicolor models. We have carried out a Schrodinger functional (SF) calculation for the lattice theory with two flavors of Wilson…
A simple permutation is one that does not map a nontrivial interval onto an interval. It was recently proved by Albert and Atkinson that a permutation class with only finitely simple permutations has an algebraic generating function. We…
Let $(x_n)_{n=1}^\infty$ be a sequence of integers. We study the number variance of dilations $(\alpha x_n)_{n=1}^\infty$ modulo 1 in intervals of length $S$, and establish pseudorandom (Poissonian) behavior for Lebesgue-almost all $\alpha$…
We present a new distribution-free conformal prediction algorithm for sequential data (e.g., time series), called the \textit{sequential predictive conformal inference} (\texttt{SPCI}). We specifically account for the nature that time…
We study the values of the M\"obius function $\mu$ of intervals in the containment poset of permutations. We construct a sequence of permutations $\pi_n$ of size $2n-2$ for which $\mu(1,\pi_n)$ is given by a polynomial in $n$ of degree 7.…
Consider the number of permutations in the symmetric group on n letters that contain c copies of a given pattern. As c varies (with n held fixed) these numbers form a sequence whose properties we study for the monotone patterns and the…
Bernoulli sieve is a recursive construction of a random composition (ordered partition) of integer $n$. This composition can be induced by sampling from a random discrete distribution which has frequencies equal to the sizes of component…
A permutation is called {\it {block-wise simple}} if it contains no interval of the form $p_1\oplus p_2$ or $p_1 \ominus p_2$. We present this new set of permutations and explore some of its combinatorial properties. We present a generating…
In the case when $X$ is a sofic shift and $\phi : X \to X$ is a homeomorphism such that $\phi^2 = \text{id}_X$ and $\phi \sigma_X = \sigma_X^{-1} \phi$, the number of points in $X$ that are fixed by $\sigma_X^m$ and $\sigma_X^n \phi$,…
Let $X_1,...,X_n$ be i.i.d. observations, where $X_i=Y_i+\sigma_n Z_i$ and the $Y$'s and $Z$'s are independent. Assume that the $Y$'s are unobservable and that they have the density $f$ and also that the $Z$'s have a known density $k.$…
Power systems, including synchronous generator systems, are typical systems that strive for stable operation. In this article, we numerically study the fault transient process of a synchronous generator system based on the first benchmark…
We give a recursive formula for the Moebius function of an interval $[\sigma,\pi]$ in the poset of permutations ordered by pattern containment in the case where $\pi$ is a decomposable permutation, that is, consists of two blocks where the…
It is a well known fact that for periodic measurable $f$ and rapidly increasing $(n_k)_{k \geq 1}$ the sequence $(f(n_kx))_{k\ge 1}$ behaves like a sequence of independent, identically distributed random variables. For example, if $f$ is a…
The circular peak set of a permutation $\sigma$ is the set $\{\sigma(i)\mid \sigma(i-1)<\sigma(i)>\sigma(i+1)\}$. In this paper, we focus on the enumeration problems for permutations by circular peak sets. Let $cp_n(S)$ denote the number of…
A sofic group $G$ is said to be flexibly stable if every sofic approximation to $G$ can converted to a sequence of disjoint unions of Schreier graphs by modifying an asymptotically vanishing proportion of edges. We establish that if…
For an integer $m \geq 2$, let $\mathcal{P}_m$ be the partition of the unit interval $I$ into $m$ equal subintervals, and let $\mathcal{F}_m$ be the class of piecewise linear maps on $I$ with constant slope $\pm m$ on each element of…
We give a syntactic view of the Sawada-Williams $(\sigma,\tau)$-generation of permutations. The corresponding sequence of $\sigma-\tau$-operations, of length $n!-1$ is shown to be highly compressible: it has $O(n^2\log n)$ bit description.…
The Special Affine Fourier Transformation(SAFT), which generalizes several well-known unitary transformations, has been demonstrated as a valuable tool in signal processing and optics. In this paper, we explore the multivariate dynamical…
The Arithmetic Fourier Transform is a numerical formulation for computing Fourier series and Taylor series coefficients. It competes with the Fast Fourier Transform in terms of speed and efficiency, requiring only addition operations and…
This paper introduces permutation-invariant Niven numbers--a novel class of Niven numbers where all digit permutations (with leading zeros automatically ignored) must retain the Niven property. We demonstrate that there exist infinitely…