Related papers: A generalization of Eulerian numbers via rook plac…
We establish an exact formula for the average number of edges appearing on the boundary of the global convex hull of n independent Brownian paths in the plane. This requires the introduction of a counting criterion which amounts to "cutting…
In this paper we study the genralized q-Euler numbers and polynomials. From our results, we derive some interesting congruences related tothe generalized q-Euler numbers.
A generalized Euler parameterization of a compact Lie group is a way for parameterizing the group starting from a maximal Lie subgroup, which allows a simple characterization of the range of parameters. In the present paper we consider the…
We present an algebraic generalization of Euler's theorem for quadrilaterals. Starting from the parallelogram identity in an inner product space, we derive Apollonius' identity and obtain Euler's quadrilateral identity in a unified vector…
Rook polynomials have been studied extensively since 1946, principally as a method for enumerating restricted permutations. However, they have also been shown to have many fruitful connections with other areas of mathematics, including…
The $k$-dimensional generalized Euler function $\varphi_k(n)$ is defined to be the number of ordered $k$-tuples $(a_1,a_2,\ldots, a_k) \in \mathbb{N}^k$ with $1\leq a_1,a_2,\ldots, a_k \leq n$ such that both the product $a_1a_2\cdots a_k$…
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm to exactly sample a random ET of the given generalized…
We introduce a new row insertion algorithm on decreasing tableaux and increasing tableaux, generalizing Edelman-Greene (EG) row insertion. Our row insertion algorithm is a nontrivial variation of Hecke column insertion which generalizes EG…
We study the question of Eulerianity (factorizability) for Fourier coefficients of automorphic forms, and we prove a general transfer theorem that allows one to deduce the Eulerianity of certain coefficients from that of another…
Rook theory has been investigated by many people since its introduction by Kaplansky and Riordan in 1946. Goldman, Joichi and White in 1975 showed that the sum over $k$ of the product of the $(n-k)$-th rook numbers multiplied by the $k$-th…
We give a general method for rounding linear programs that combines the commonly used iterated rounding and randomized rounding techniques. In particular, we show that whenever iterated rounding can be applied to a problem with some slack,…
We study the generalized Galois numbers which count flags of length r in N-dimensional vector spaces over finite fields. We prove that the coefficients of those polynomials are asymptotically Gaussian normally distributed as N becomes…
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…
Inspired by the paper of Bonichon, Bousquet-M\'elou, Dorbec and Pennarun, we give a system of functional equations which characterise the ordinary generating function, $U(x),$ for the number of planar Eulerian orientations counted by edges.…
We consider the numbers arising in the problem of normal ordering of expressions in canonical boson creation and annihilation operators. We treat a general form of a boson string which is shown to be associated with generalizations of…
We study the combinatorial representation theory of the ``planar rook algebra" $P_n$. This algebra has a basis consisting of planar rook diagrams and multiplication given by diagram concatenation. For each integer $0 \le k \le n$, we…
E394 in the Enestrom index. Translated from the Latin original, "De partitione numerorum in partes tam numero quam specie datas" (1768). Euler finds a lot of recurrence formulas for the number of partitions of $N$ into $n$ parts from some…
Let $E$ be an elliptic curve defined over a number field $k$ and $\ell$ a prime integer. When $E$ has at least one $k$-rational point of exact order $\ell$, we derive a uniform upper bound $\exp(C \log B / \log \log B)$ for the number of…
We characterize the power of constant-depth Boolean circuits in generating uniform symmetric distributions. Let $f\colon\{0,1\}^m\to\{0,1\}^n$ be a Boolean function where each output bit of $f$ depends only on $O(1)$ input bits. Assume the…
We introduce Euler summability method for sequences of fuzzy numbers and state a Tauberian theorem concerning Euler summability method, of which proof provides an alternative to that of K. Knopp[\"Uber das Eulersche Summierungsverfahren II,…