Results 21 to 30 of about 45 (45)

YANG–BAXTER FIELD FOR SPIN HALL–LITTLEWOOD SYMMETRIC FUNCTIONS

Forum of Mathematics, Sigma, 2019
Employing bijectivization of summation identities, we introduce local stochastic moves based on the Yang–Baxter equation for $U_{q}(\widehat{\mathfrak{sl}_{2}})$.
ALEXEY BUFETOV, LEONID PETROV
doaj   +1 more source

Circular Polya distributions of order k

International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 25, Page 1563-1575, 2003., 2003
Two circular Polya distributions of order k are derived by means of generalized urn models and by compounding, respectively, the type I and type II circular binomial distributions of order k of Makri and Philippou (1994) with the beta distribution.
Gregory A. Tripsiannis, Andreas N. Philippou   +1 more
wiley   +1 more source

On the local time density of the reflecting Brownian bridge

International Journal of Stochastic Analysis, Volume 13, Issue 2, Page 125-136, 2000., 2000
Expressions for the multi‐dimensional densities of Brownian bridge local time are derived by two different methods: A direct method based on Kac′s formula for Brownian functionals and an indirect one based on a limit theorem for strata of random mappings.
Bernhard Gittenberger, Guy Louchard
wiley   +1 more source

BROOKS’ THEOREM FOR MEASURABLE COLORINGS

Forum of Mathematics, Sigma, 2016
We generalize Brooks’ theorem to show that if $G$ is a Borel graph on a standard Borel space $
CLINTON T. CONLEY, ANDREW S. MARKS, ROBIN D. TUCKER-DROB   +2 more
doaj   +1 more source

An Alternative Proof for the Expected Number of Distinct Consecutive Patterns in a Random Permutation [PDF]

Discrete Mathematics & Theoretical Computer Science
Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of distinct ...
Anant Godbole, Hannah Swickheimer
doaj   +1 more source

Two-Point Concentration of the Independence Number of the Random Graph

Forum of Mathematics, Sigma
We show that the independence number of $ G_{n,p}$ is concentrated on two values if $ n^{-2/3+ \epsilon } < p \le 1$ . This result is roughly best possible as an argument of Sah and Sawhney shows that the independence number is not, in ...
Tom Bohman, Jakob Hofstad
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

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

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

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