相关论文: Counting stabilized-interval-free permutations

An involution on a finite set is a bijection such as I(I(e))=e for all the element of the set. A fixed-point free involution on a finite set is an involution such as I(e)=e for none element of the set. In this article, the fixed-point free…

We introduce notions of a constraint metric approximation and of a constraint stability of a metric approximation. This is done in the language of group equations with coefficients. We give an example of a group which is not constraintly…

In this paper, we study some properties of a certain kind of permutation $\sigma$ over $\mathbb{F}_{2}^{n}$, where $n$ is a positive integer. The desired properties for $\sigma$ are: (1) the algebraic degree of each component function is…

In this paper, we consider issues relative to prescribed time stabilisation of a chain of integrators of arbitrary length, either pure (i.e., where there is no disturbance) or perturbed. In a first part, we revisit the proportional…

We provide a bijective proof of a formula of Auli and the author expressing the number of inversion sequences with no three consecutive equal entries in terms of the number of non-derangements, that is, permutations with fixed points.…

A permutation $\pi \in \mathbb{S}_n$ is $k$-balanced if every permutation of order $k$ occurs in $\pi$ equally often, through order-isomorphism. In this paper, we explicitly construct $k$-balanced permutations for $k \le 3$, and every $n$…

Let $\Omega$ be the set of odd positive integers and let $S:\Omega \rightarrow \Omega$ be the Syracuse function. It is proved that, for every permutation $\sigma$ of $(1,2,3)$, the set of triples of the form $(m,S(m),S^2(m))$ with…

Generative (diffusion) priors demonstrate remarkable performance in addressing inverse problems in imaging. Yet, for scientific and medical imaging, it is crucial that reconstruction techniques remain stable and reliable under imperfect…

Given a set $I \subseteq \mathbb{N}$, consider the sequences $\{d_n(I)\},\{p_n(I)\}$ where for any $n$, $d_n(I)$ and $p_n(I)$ respectively count the number of permutations in the symmetric group $\mathfrak{S}_n$ whose descent set…

Let $X_n = \{1,2,\dots,n\}$ be a finite set $(n\geq 2)$ and $T_n$ the full transformation semigroup on $X_n$. For a positive integer $l\leq n-1$, we define $$T_n(l) = \{\alpha\in T_n \colon \forall x,y\in X_n,\, |x-y| = l \;\Rightarrow\;…

In the present work, the notion of Super Fractal Interpolation Function (SFIF) is introduced for finer simulation of the objects of the nature or outcomes of scientific experiments that reveal one or more structures embedded in to another.…

Let m be a fixed positive integer. It is well-known that a permutation $\sigma$ may have one, many, or no mth roots. In this note we provide an explicit expression and a generating function for the number of mth roots of \sigma. Let p_m(n)…

A permutation-invariant quantum code on $N$ qudits is any subspace stabilized by the matrix representation of the symmetric group $S_N$ as permutation matrices that permute the underlying $N$ subsystems. When each subsystem is a complex…

An involution is a bijection that is its own inverse. Given a permutation $\sigma$ of $[n],$ let $\mathsf{invol}(\sigma)$ denote the number of ways $\sigma$ can be expressed as a composition of two involutions of $[n].$ We prove that the…

In this paper, we use Hasse diagrams and generating functions to count alternating permutations with restricted prefix and suffix of lengths 3 and 4. In other words, for an alternating permutation…

In this paper, we study the generating functions for the number of pattern restricted Stirling permutations with a given number of plateaus, descents and ascents. Properties of the generating functions, including symmetric properties and…

We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…

This article deals with stability of continuous-time switched linear systems under constrained switching. Given a family of linear systems, possibly containing unstable dynamics, we characterize a new class of switching signals under which…

We consider the effect on the mixing properties of a piecewise smooth interval map $f$ when its domain is divided into $N$ equal subintervals and $f$ is composed with a permutation of these. The case of the stretch-and-fold map $f(x)=mx…

A sequence of random variables is called exchangeable if the joint distribution of the sequence is unchanged by any permutation of the indices. De Finetti's theorem characterizes all $\{0,1\}$-valued exchangeable sequences as a "mixture" of…