Related papers: Continuants, run lengths, and Barry's modified Pas…
We define the $m$th-order Eulerian numbers with a combinatorial interpretation. The recurrence relation of the $m$th-order Eulerian numbers, the row generating function and the row sums of the $m$th-order Eulerian triangle are presented. We…
Consider the representation of a rational number in the form, associated with "centered" Euclidean algorithm. We prove a new formula for the limit distribution function for sequences of rationals with bounded sum of partial quotients.
This study continues three recent papers in which barypolygonal sequences have been defined and their properties of convergence demonstrated. Any barypolygonal sequence $\mathcal{B}$ of a finite set $\mathcal{A}$ comprising $p\ge 2$ points…
In two previous papers we have presented partition formulae for the Fibonacci numbers motivated by the appearance of the Fibonacci numbers in the representation theory of the 3-Kronecker quiver and its universal cover, the 3-regular tree.…
We study M\"obius transformations (also known as linear fractional transformations) of quadratic numbers. We construct explicit upper and lower bounds on the period of the continued fraction expansion of a transformed number as a function…
The graph of overlapping permutations is a directed graph that is an analogue to the De Bruijn graph. It consists of vertices that are permutations of length $n$ and edges that are permutations of length $n+1$ in which an edge $a_1\cdots…
Traces and their extension called combined traces (comtraces) are two formal models used in the analysis and verification of concurrent systems. Both models are based on concepts originating in the theory of formal languages, and they are…
We consider a symbolic coding of linear trajectories in the regular octagon with opposite sides identified (and more generally in regular 2n-gons). Each infinite trajectory gives a cutting sequence corresponding to the sequence of sides…
In this paper, we define Tribonacci and Tribonacci-Lucas matrix sequences and investigate their properties.
We establish a new transcendence criterion of $p$-adic continued fractions which are called Ruban continued fractions. By this result, we give explicit transcendental Ruban continued fractions with bounded $p$-adic absolute value of partial…
This paper presents a sharp approximation of the density of long runs of a random walk conditioned on its end value or by an average of a functions of its summands as their number tends to infinity. The conditioning event is of moderate or…
In this note we augment the poly-Bernoulli family with two new combinatorial objects. We derive formulas for the relatives of the poly-Bernoulli numbers using the appropriate variations of combinatorial interpretations. Our goal is to show…
The determinant of an $N \times N$ circulant matrix $M = {\rm CIRC}[x_0, x_1, ..., x_{N-1}$] can be expanded in the form det$ ~M= \sum C_{a_0 a_1 ...a_{N-1}} x_{a_0} x_{a_1}...x_{a_{N-1}}$. By using the generating function of a restricted,…
We define and characterize the $f$-matrices associated to Pascal-like matrices that are defined by ordinary and exponential Riordan arrays. These generalize the face matrices of simplices and hypercubes. Their generating functions can be…
The Eulerian triangle is a classical array of combinatorial numbers defined by a linear recursion. The associated boundary problem asks one to find all extreme nonnegative solutions to a dual recursion. Exploiting connections with random…
Combinatorial aspects of multivariate diagonal invariants of the symmetric group are studied. As a consequence it is proved the existence of a multivariate extension of the classical Robinson-Schensted correspondence. Further byproduct are…
There is a digraph corresponding to every square matrix over $\mathbb{C}$. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence…
The representation of integral binary forms as sums of two squares is discussed and applied to establish the Manin conjecture for certain Ch\^atelet surfaces defined over the rationals.
Polynomial sequences $p_n(x)$ of binomial type are a principal tool in the umbral calculus of enumerative combinatorics. We express $p_n(x)$ as a \emph{path integral} in the ``phase space'' $\Space{N}{} \times {[-\pi,\pi]}$. The Hamiltonian…
In a previous escapade we gave a collection of continued fractions involving Catalan's constant. This paper provides more general formulae governing those continued fractions. Having distinguished different cases associated to regions in…