Results 71 to 80 of about 1,071 (104)
Multiplicative and Exponential Variations of Orthomorphisms of Cyclic Groups
An orthomorphism is a permutation $\sigma$ of $\{1, \dots, n-1\}$ for which $x + \sigma(x) \mod n$ is also a permutation on $\{1, \dots, n-1\}$. Eberhard, Manners, Mrazovi\'c, showed that the number of such orthomorphisms is $(\sqrt{e} + o(1)) \cdot ...
Chen, Evan
core
On Matrices with Bidimensional Fibonacci Numbers
In this paper, the bidimensional extensions of the Fibonacci numbers are explored, along with a detailed examination of their properties, characteristics, and some identities.
Costa Eudes Antonio +1 more
doaj +1 more source
Two-sided permutation statistics via symmetric functions
Given a permutation statistic $\operatorname {\mathrm {st}}$ , define its inverse statistic $\operatorname {\mathrm {ist}}$ by . We give a general approach, based on the theory of symmetric functions, for finding the joint distribution of
Ira M. Gessel, Yan Zhuang
doaj +1 more source
Involution factorizations of Ewens random permutations [PDF]
An involution is a bijection that is its own inverse. Given a permutation $σ$ of $[n],$ let $\mathsf{invol}(σ)$ denote the number of ways $σ$ can be expressed as a composition of two involutions of $[n].$ We prove that the statistic $\mathsf{invol}$ is ...
Charles Burnette
doaj +1 more source
Subspace profiles over finite fields and q-Whittaker expansions of symmetric functions
Bender, Coley, Robbins, and Rumsey posed the problem of counting the number of subspaces which have a given profile with respect to a linear endomorphism defined on a finite vector space.
Samrith Ram
doaj +1 more source
Pattern Avoidance in Weak Ascent Sequences [PDF]
In this paper, we study pattern avoidance in weak ascent sequences, giving some results for patterns of length 3. This is an analogous study to one given by Duncan and Steingr\'imsson (2011) for ascent sequences. More precisely, we provide systematically
Beáta Bényi +2 more
doaj +1 more source
Interval and $\ell$-interval Rational Parking Functions [PDF]
Interval parking functions are a generalization of parking functions in which cars have an interval preference for their parking. We generalize this definition to parking functions with $n$ cars and $m\geq n$ parking spots, which we call interval ...
Tomás Aguilar-Fraga +14 more
doaj +1 more source
Finite automata, probabilistic method, and occurrence enumeration of a pattern in words and permutations. [PDF]
Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
Vertically symmetric alternating sign matrices (VSASMs) of order $2n+1$ are known to be equinumerous with lozenge tilings of a hexagon with side lengths $2n+2,2n,2n+2,2n,2n+2,2n$ and a central triangular hole of size $2$ that exhibit
Ilse Fischer, Hans Höngesberg
doaj +1 more source
Distribution and asymptotic behavior of the phylogenetic transfer distance. [PDF]
Dávila Felipe M +4 more
europepmc +1 more source

