Results 101 to 110 of about 147,491 (227)

(Random) Trees of Intermediate Volume Growth

Random Structures &Algorithms, Volume 67, Issue 4, December 2025.
ABSTRACT For every function g:ℝ≥0→ℝ≥0$$ g:{\mathbb{R}}_{\ge 0}\to {\mathbb{R}}_{\ge 0} $$ that grows at least linearly and at most exponentially, if it is sufficiently well‐behaved, we can construct a tree T$$ T $$ of uniform volume growth g$$ g $$, or more precisely, C1·g(r/4)≤|BG(v,r)|≤C2·g(4r),for allr≥0andv∈V(T),$$ {C}_1\cdotp g\left(r/4\right)\le \
George Kontogeorgiou, Martin Winter
wiley   +1 more source

U-duality and D-brane combinatorics [PDF]

, 1998
B. Pioline, E. Kiritsis, B. Pioline, E. Kiritsis   +3 more
openalex   +1 more source

On Constrained Matchings, Stable Under Random Preferences

Random Structures &Algorithms, Volume 67, Issue 4, December 2025.
ABSTRACT Colloquially, there are two groups, n$$ n $$ men and n$$ n $$ women, each man (woman) ranking women (men) as potential marriage partners. A complete matching is called stable if no unmatched pair prefer each other to their partners in the matching.
Boris Pittel
wiley   +1 more source

Mixability of Finite Groups

Random Structures &Algorithms, Volume 67, Issue 4, December 2025.
ABSTRACT A finite group G$$ G $$ is mixable if a product of random elements, each chosen independently from two options, can distribute uniformly on G$$ G $$. We present conditions and obstructions to mixability. We show that 2‐groups, the symmetric groups, the simple alternating groups, several matrix and sporadic simple groups, and most finite ...
Gideon Amir, Guy Blachar, Subhajit Ghosh, Uzi Vishne   +3 more
wiley   +1 more source

A Note on the generating function of p-Bernoulli numbers

, 2018
We use analytic combinatorics to give a direct proof of the closed formula for the generating function of $p$-Bernoulli numbers.Comment: 6 ...
Kuba, Markus
core  

2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) [PDF]

, 2019
Mishna, Marni, Munro, J. Ian 1947-, ANALCO 2019 San Diego, Calif.   +2 more
openalex   +1 more source

Fast and Slow Mixing of the Kawasaki Dynamics on Bounded‐Degree Graphs

Random Structures &Algorithms, Volume 67, Issue 4, December 2025.
ABSTRACT We study the worst‐case mixing time of the global Kawasaki dynamics for the fixed‐magnetization Ising model on the class of graphs of maximum degree Δ$$ \Delta $$. Proving a conjecture of Carlson, Davies, Kolla, and Perkins, we show that below the tree‐uniqueness threshold, the Kawasaki dynamics mix rapidly for all magnetizations. Disproving a
Aiya Kuchukova, Marcus Pappik, Will Perkins, Corrine Yap   +3 more
wiley   +1 more source

RAINBOW VERTEX CONNECTION NUMBER OF BULL GRAPH, NET GRAPH, TRIANGULAR LADDER GRAPH, AND COMPOSITION GRAPH (P_n [P_1 ])

Barekeng
The rainbow connection was first introduced by Chartrand in 2006 and then in 2009 Krivelevich and Yuster first time introduced the rainbow vertex connection. Let graph be a connected graph.
Muhammad Ilham Nurfaizi Annadhifi, Robiatul Adawiyah, Dafik Dafik, I Nengah Suparta   +3 more
doaj   +1 more source

Matrix ansatz and combinatorics of the $k$-species PASEP [PDF]

, 2015
Olya Mandelshtam
openalex   +1 more source

The shift‐homological spectrum and parametrising kernels of rank functions

Journal of the London Mathematical Society, Volume 112, Issue 6, December 2025.
Abstract For any compactly generated triangulated category, we introduce two topological spaces, the shift spectrum and the shift‐homological spectrum. We use them to parametrise a family of thick subcategories of the compact objects, which we call radical.
Isaac Bird, Jordan Williamson, Alexandra Zvonareva   +2 more
wiley   +1 more source