相关论文: Parity-Alternate Permutations and Signed Eulerian …

We recall the Alon-Tarsi conjecture on the number of even latin squares. We introduce a map which switches the parity of a latin square under certain requirements. An example is included.

We define a generalization of the Eulerian polynomials and the Eulerian numbers by considering a descent statistic on segmented permutations coming from the study of 2-species exclusion processes and a change of basis in a Hopf algebra. We…

The simple permutations in two permutation classes --- the 321-avoiding permutations and the skew-merged permutations --- are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards…

The p-adic valuations of a sequence of integers T(n) counting alternating sign matrices is examined for p=2 and p=3. Symmetry properties of their graphs produce a new proof of the result that characterizes the indices for which T(n) is odd.

We consider a permutation method for testing whether observations given in their natural pairing exhibit an unusual level of similarity in situations where any two observations may be similar at some unknown baseline level. Under a null…

Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…

We establish some identities of Euler related sums. By using these identities, we discuss the closed form representations of sums of harmonic numbers and reciprocal parametric binomial coefficients through parametric harmonic numbers,…

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…

Andr\'e proved that the number of alternating permutations on $\{1, 2, \dots, n\}$ is equal to the Euler number $E_n$. A refinement of Andr\'e's result was given by Entringer, who proved that counting alternating permutations according to…

When permutation methods are used in practice, often a limited number of random permutations are used to decrease the computational burden. However, most theoretical literature assumes that the whole permutation group is used, and methods…

Signed shifts are generalizations of the shift map in which, interpreted as a map from the unit interval to itself sending x to the fractional part of Nx, some slopes are allowed to be negative. Permutations realized by the relative order…

Natural numbers which are nontrivial multiples of some permutation of their base-$b$ digit representations are called permutiples. Specific cases include numbers which are multiples of cyclic permutations (cyclic numbers) and reversals of…

In this paper we at first consider plane trees with the root vertex and a marked directed edge, outgoing from the root vertex. For such trees we introduce a new characteristic --- the \emph{parity}, using the bracket code. It turns out that…

Recently, authors studied the unsigned degenerate r-Stirling number of the first kind and the degenerate r-Stirling number of the second kind, respectively of which are the degenerate versions of the unsigned r-Stirling numbers of the first…

The excedance number for S_n is known to have an Eulerian distribution. Nevertheless, the classical proof uses descents rather than excedances. We present a direct recursive proof which seems to be folklore and extend it to the colored…

In this paper, we characterize a duality relation between Eulerian recurrences and Eulerian recurrence systems, which generalizes and unifies Hermite-Biehler decompositions of several enumerative polynomials, including flag descent…

By using the elementary symmetric polynomials and some results of number theory, we solve the well known problem of Lehmer on Euler's totient function. As application, we obtain a new characterization of prime numbers.

Reciprocal transformations mix the role of the dependent and independent variables to achieve simpler versions or even linearized versions of nonlinear PDEs. These transformations help in the identification of a plethora of PDEs available…

The purpose of this article is to introduce the concept of invariance and its properties. These properties can be used to check the primality of a number. Combining these properties with the Euler theorem, it is possible to generalize this…

Based on a determinantal formula for the higher derivative of a quotient of two functions, we first present the determinantal expressions of Eulerian polynomials and Andre polynomials. In particular, we discover that the Euler number…