Related papers: Derangements and Euler's difference table for $C_\…
Using a new colored analogue of P-partitions, we prove the existence of a colored Eulerian descent algebra which is a subalgebra of the Mantaci-Reutenauer algebra. This algebra has a basis consisting of formal sums of colored permutations…
This paper sets out to introduce the generalized derangement polynomials of order $r $. It then proceeds to establish various identities associated with these polynomials, along with providing recurrence relations for derangement…
The Eulerian idempotents, first introduced for the symmetric group and later extended to all reflection groups, generate a family of representations called the Eulerian representations that decompose the regular representation. In Type $A$,…
We study in this paper the continuous and discrete Euler-Lagrange equations arising from a quadratic lagrangian. Those equations may be thought as numerical schemes and may be solved through a matrix based framework. When the lagrangian is…
We study the inverse problem in the difference Galois theory of linear differential equations over the difference-differential field $\mathbb{C}(x)$ with derivation $\frac{d}{dx}$ and endomorphism $f(x)\mapsto f(x+1)$. Our main result is…
The definition and properties of the Euler-Lagrange cohomology groups $H^{2k-1}$, $1 \leqslant k \leqslant n$, on a symplectic manifold $({\cal M}^{2n},\omega)$ are given and studied. For $k = 1$ and $k = n$, they are isomorphic to the…
We give a combinatorial proof of an identity that involves Eulerian numbers and was obtained algebraically by Brenti and Welker (2009). To do so, we study alcoved triangulations of dilated hypersimplices. As a byproduct, we describe the…
It is conjectured that within the class group of any number field, for every integer $\ell \geq 1$, the $\ell$-torsion subgroup is very small (in an appropriate sense, relative to the discriminant of the field). In nearly all settings, the…
In a paper of 2003, B. K\"ulshammer, J. B. Olsson and G. R. Robinson defined $\ell$-blocks for the symmetric groups, where $\ell >1$ is an arbitrary integer. In this paper, we give a definition for the defect group of the principal…
Congruence families, i.e., $\ell$-adic convergence for well-defined arithmetic subsequences, is a commonplace phenomenon for the coefficients of modular forms. Such families superficially resemble one another, but they often vary…
In this paper, we investigate new class of sequences related to fully degenerate Bernoulli numbers and polynomials. From those sequences, we derive some formulae for the degenerate Bernoulli and Euler polynomials.
The second author studied arithmetic properties of a class of sequences that generalize the sequence of derangements. The aim of the following paper is to disprove two conjectures stated in \cite{miska}. The first conjecture regards the set…
We introduce the notion of difference equation defined on a structured set. The symmetry group of the structure determines the set of difference operators. All main notions in the theory of difference equations are introduced as invariants…
Basic results in combinatorial mathematics provide the foundation for a theory and calculus for reasoning about sequential behavior. A key concept of the theory is a generalization of Boolean implicant which deals with statements of the…
We establish Euler-Lagrange equations for a problem of Calculus of variations where the unknown variable contains a term of delay on a segment.
\'{E}tale difference algebraic groups are a difference analog of \'{e}tale algebraic groups. Our main result is a Jordan-H\"{o}lder type decomposition theorem for these groups. Roughly speaking, it shows that any \'{e}tale difference…
It is known that the ordered Bell numbers count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$. In this paper, we introduce the deranged Bell numbers that count the total number of deranged partitions of $[n]$. We first study…
Unitarity cannot be perserved order by order in ordinary perturbation theory because the constraint $UU^\dagger=\1$ is nonlinear. However, the corresponding constraint for $K=\ln U$, being $K=-K^\dagger$, is linear so it can be maintained…
Let $A(n,m)$ denote the Eulerian numbers, which count the number of permutations on $[n]$ with exactly $m$ descents. It is well known that $A(n,m)$ also counts the number of permutations on $[n]$ with exactly $m$ excedances. In this report,…
In combinatorics, a derangement is a permutation that has no fixed points. The number of derangements of an n-element set is called the n-th derangement number. In this paper, as natural companions to derangement numbers and degenerate…