Results 31 to 40 of about 94 (91)

Zagreb connection indices on polyomino chains and random polyomino chains

Open Mathematics
In this manuscript, we delve into the exploration of the first and second Zagreb connection indices of both polyomino chains and random polyomino chains. Our methodology relies on the utilization of Markov chain theory. Within this framework, the article
Sigarreta Saylé, Cruz-Suárez Hugo
doaj   +1 more source

A logical limit law for $231$-avoiding permutations [PDF]

Discrete Mathematics & Theoretical Computer Science
We prove that the class of 231-avoiding permutations satisfies a logical limit law, i.e. that for any first-order sentence $\Psi$, in the language of two total orders, the probability $p_{n,\Psi}$ that a uniform random 231-avoiding permutation of size $n$
Michael Albert, Mathilde Bouvel, Valentin Féray, Marc Noy   +3 more
doaj   +1 more source

On the First Entrance Time Distribution of the M/D/i Queue: A Combinatorial Approach [PDF]

, 1996
AMS classifications: 60C05; 60K25; 90B06 ...
Jansen, J.B.
core   +1 more source

Measurable Vizing’s theorem

Forum of Mathematics, Sigma
We prove a full measurable version of Vizing’s theorem for bounded degree Borel graphs, that is, we show that every Borel graph $\mathcal {G}$ of degree uniformly bounded by $\Delta \in \mathbb {N}$ defined on a standard probability space
Jan Grebík
doaj   +1 more source

Characterization of stationary probability measures for Variable Length Markov Chains

, 2018
By introducing a key combinatorial structure for words produced by a Variable Length Markov Chain (VLMC), the longest internal suffix, precise characterizations of existence and uniqueness of a stationary probability measure for a VLMC chain are given ...
Pouyanne, Nicolas, Paccaut, Frédéric, Chauvin, Brigitte, Cénac, Peggy   +3 more
core   +1 more source

An open toss problem

, 1993
International Journal of Mathematics and Mathematical Sciences, Volume 16, Issue 3, Page 621-623, 1993.
Prem N. Bajaj, G. R. Mendieta
wiley   +1 more source

Random Fibonacci Words via Clone Schur Functions

Forum of Mathematics, Sigma
We investigate positivity and probabilistic properties arising from the Young–Fibonacci lattice $\mathbb {YF}$ , a 1-differential poset on words composed of 1’s and 2’s (Fibonacci words) and graded by the sum of the digits.
Leonid Petrov, Jeanne Scott
doaj   +1 more source

© Hindawi Publishing Corp. EXTENDED FIBONACCI NUMBERS AND POLYNOMIALS WITH PROBABILITY APPLICATIONS [PDF]

, 2004
The extended Fibonacci sequence of numbers and polynomials is introduced and studied. The generating function, recurrence relations, an expansion in terms of multinomial coefficients, and several properties of the extended Fibonacci numbers and ...
Demetrios L. Antzoulakos
core  

On a generalization of derangement polynomials and numbers

Demonstratio Mathematica
In T. Kim, D. S. Kim, and D. V. Dolgy, Probabilistic derangement numbers and polynomials, Math. Comput. Model. Dyn. Syst. 31 (2025), no. 1, 2529188, Kim-Kim defined the probabilistic derangement polynomials and numbers and found some properties of those ...
Yun Sang Jo, Park Jin-Woo
doaj   +1 more source

Some enumerative properties of parking functions

A parking function is a sequence \((\pi_1,\dots, \pi_n)\) of positive integers such that if \(\lambda_1\leq\cdots\leq \lambda_n\) is the increasing rearrangement of \(\pi_1,\dots,\pi_n\), then \(\lambda_i\leq i\) for \(1\leq i\leq n\).
Stanley, Richard P, Yin, Mei
core   +2 more sources