Results 51 to 60 of about 11,854 (238)

On the Structure of Bispecial Sturmian Words

, 2013
A balanced word is one in which any two factors of the same length contain the same number of each letter of the alphabet up to one. Finite binary balanced words are called Sturmian words.
Fici, Gabriele
core   +1 more source

Lessons in Enumerative Combinatorics. By Ömer Eğecioğlu and Adriano M. Garsia. Springer, 2021. Softcover, pp. xvi + 479. ISBN 978-3-030-71252-5. Price EUR 68.56. [PDF]

, 2022
Firdous Ahmad Mala, Firdous Ahmad Mala
openalex   +1 more source

Existence and orthogonality of stable envelopes for bow varieties

Bulletin of the London Mathematical Society, Volume 57, Issue 11, Page 3249-3306, November 2025.
Abstract Stable envelopes, introduced by Maulik and Okounkov, provide a family of bases for the equivariant cohomology of symplectic resolutions. They are part of a fascinating interplay between geometry, combinatorics and integrable systems. In this expository article, we give a self‐contained introduction to cohomological stable envelopes of type A$A$
Catharina Stroppel, Till Wehrhan
wiley   +1 more source

A survey of subdivisions and local $h$-vectors [PDF]

, 2015
The enumerative theory of simplicial subdivisions (triangulations) of simplicial complexes was developed by Stanley in order to understand the effect of such subdivisions on the $h$-vector of a simplicial complex.
Athanasiadis, Christos A.
core  

Indiscernibles in monadically NIP theories

Bulletin of the London Mathematical Society, Volume 57, Issue 11, Page 3326-3345, November 2025.
Abstract We prove various results around indiscernibles in monadically NIP theories. First, we provide several characterizations of monadic NIP in terms of indiscernibles, mirroring previous characterizations in terms of the behavior of finite satisfiability. Second, we study (monadic) distality in hereditary classes and complete theories.
Samuel Braunfeld, Michael C. Laskowski
wiley   +1 more source

Estimates on the decay of the Laplace–Pólya integral

Bulletin of the London Mathematical Society, Volume 57, Issue 11, Page 3360-3379, November 2025.
Abstract The Laplace–Pólya integral, defined by Jn(r)=1π∫−∞∞sincntcos(rt)dt$J_n(r) = \frac{1}{\pi }\int _{-\infty }^\infty \operatorname{sinc}^n t \cos (rt) \,\mathrm{d}t$, appears in several areas of mathematics. We study this quantity by combinatorial methods; accordingly, our investigation focuses on the values at integer rs$r{\rm s}$.
Gergely Ambrus, Barnabás Gárgyán
wiley   +1 more source

Centrality of star and monotone factorisations

Bulletin of the London Mathematical Society, Volume 57, Issue 11, Page 3567-3585, November 2025.
Abstract A factorisation problem in the symmetric group is central if conjugate permutations always have the same number of factorisations. We give the first fully combinatorial proof of the centrality of transitive star factorisations that is valid in all genera, which answers a natural question of Goulden and Jackson from 2009.
Jesse Campion Loth, Amarpreet Rattan
wiley   +1 more source

Enumeration of E ( s 2 )‐Optimal and Minimax‐Optimal Supersaturated Designs With 12 Rows, 11 q Columns and s max = 4

Journal of Combinatorial Designs, Volume 33, Issue 10, Page 379-387, October 2025.
ABSTRACT The E ( s 2 )‐optimal and minimax‐optimal supersaturated designs (SSDs) with 12 rows, 11 q columns, and s max = 4 are enumerated in a computer search: there are, respectively, 34, 146, 0, 3, and 1 such designs for q = 2 , 3 , 4 , 5, and 6. Cheng and Tang proved that for q > 6, there are no such SSDs.
Luis B. Morales
wiley   +1 more source

Selected non-holonomic functions in lattice statistical mechanics and enumerative combinatorics

, 2015
We recall that the full susceptibility series of the Ising model, modulo powers of the prime 2, reduce to algebraic functions. We also recall the non-linear polynomial differential equation obtained by Tutte for the generating function of the q-coloured ...
Boukraa, S., Maillard, J-M.
core   +2 more sources

Symmetric 2‐ ( 35 , 17 , 8 ) Designs With an Automorphism of Order 2

Journal of Combinatorial Designs, Volume 33, Issue 10, Page 399-403, October 2025.
ABSTRACT The largest prime p that can be the order of an automorphism of a 2‐ ( 35 , 17 , 8 ) design is p = 17, and all 2‐ ( 35 , 17 , 8 ) designs with an automorphism of order 17 were classified by Tonchev. The symmetric 2‐ ( 35 , 17 , 8 ) designs with automorphisms of an odd prime order p < 17 were classified in Bouyukliev, Fack and Winne and ...
Sanja Rukavina, Vladimir D. Tonchev
wiley   +1 more source