Results 51 to 60 of about 35,860 (197)
The Role of Dice in the Emergence of the Probability Calculus
International Statistical Review, Volume 94, Issue 2, Page 464-483, August 2026.Summary The early development of the probability calculus was clearly influenced by the roll of dice. However, while dice have been cast since time immemorial, documented calculations on the frequency of various dice throws date back only to the mid‐13th century.
David R. Bellhouse, Christian Genest
wiley +1 more source
On a Ramsey–Turán variant of Roth's theorem
Bulletin of the London Mathematical Society, Volume 58, Issue 8, August 2026.Abstract A classical theorem of Roth states that the maximum size of a solution‐free set of a homogeneous linear equation L$\mathcal {L}$ in Fp$\mathbb {F}_p$ is o(p)$o(p)$ if and only if the sum of the coefficients of L$\mathcal {L}$ is 0. In this paper, we prove a Ramsey–Turán variant of Roth's theorem, with respect to a natural notion of “structured”
Matija Bucić +4 more
wiley +1 more source
Enumerative combinatorics, continued fractions and total positivity [PDF]
, 2023 Determining whether a given number is positive is a fundamental question in mathematics. This can sometimes be answered by showing that the number counts some collection of objects, and hence, must be positive.
Deb, Bishal
core +1 more source
Software for enumerative and analytic combinatorics
CoRR, 2016 We survey some general-purpose symbolic software packages that implement algorithms from enumerative and analytic combinatorics. Software for the following areas is covered: basic combinatorial objects, symbolic combinatorics, Pólya theory, combinatorial species, and asymptotics.
openaire +2 more sources
Cluster scattering diagrams via quiver moduli and tight gradings
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract We study rank‐2 cluster scattering diagrams through moduli spaces of quiver representations and a recently developed combinatorial framework of tight gradings. Combining quiver‐theoretic and combinatorial methods, we prove and extend a collection of conjectures posed by Elgin–Reading–Stella concerning the structural and enumerative properties ...
Amanda Burcroff +4 more
wiley +1 more source
Skew shapes, Ehrhart positivity, and beyond
Proceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.Abstract A classical result by Kreweras (1965) allows one to compute the number of plane partitions of a given skew shape and bounded parts as certain determinants. We prove that these determinants expand as polynomials with nonnegative coefficients.
Luis Ferroni +2 more
wiley +1 more source
Character deflations and a generalization of the Murnaghan--Nakayama rule [PDF]
, 2014 Given natural numbers m and n, we define a deflation map from the characters of the symmetric group S_{mn} to the characters of S_n. This map is obtained by first restricting a character of S_{mn} to the wreath product S_m ?S_n, and then taking the ...
Evseev, Anton +3 more
core +1 more source
Journal of Combinatorial Designs, Volume 34, Issue 7, Page 306-329, July 2026.ABSTRACT In this paper, we study and characterise the natural embedding of the twisted triality hexagon T ( q 3 , q ) in PG ( 7 , q 3 ). We begin by describing the possible intersections of subspaces of PG ( 7 , q 3 ) with T ( q 3 , q ). Then, we provide conditions on a set of lines ℒ, which ensure that ℒ forms the line set of a naturally embedded ...
Sebastian Petit, Geertrui Van de Voorde
wiley +1 more source
Is It Easier to Count Communities Than Find Them?
Random Structures &Algorithms, Volume 68, Issue 4, July 2026.ABSTRACT Random graph models with community structure have been studied extensively in the literature. For both the problems of detecting and recovering community structure, an interesting landscape of statistical and computational phase transitions has emerged. A natural unanswered question is: Might it be possible to infer properties of the community
Cynthia Rush +3 more
wiley +1 more source
Combinatorics of H-primes in quantum matrices [PDF]
, 2006 For q epsilon C transcendental over Q, we give an algorithmic construction of an order-isomorphism between the set of H-primes of O-q (M-n (C)) and the sub-poset S of the (reverse) Bruhat order of the symmetric group S-2n consisting of those permutations
Stéphane Launois, Launois, Stephane
core +1 more source