Results 41 to 50 of about 11,862 (202)

On the Structure of Bispecial Sturmian Words

open access: yes, 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

Solving a Random Asymmetric TSP Exactly in Quasi‐Polynomial Time W.H.P.

open access: yesRandom Structures &Algorithms, Volume 68, Issue 2, March 2026.
ABSTRACT Let the costs C(i,j)$$ C\left(i,j\right) $$ for an instance of the Asymmetric Traveling Salesperson Problem (ATSP) be independent copies of a nonnegative random variable C$$ C $$ from a class of distributions that include the uniform [0,1]$$ \left[0,1\right] $$ distribution and the exponential mean 1 distribution with mean 1.
Tolson Bell, Alan M. Frieze
wiley   +1 more source

Zarankiewicz bounds from distal regularity lemma

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 3, March 2026.
Abstract Since Kővári, Sós and Turán proved upper bounds for the Zarankiewicz problem in 1954, much work has been undertaken to improve these bounds, and some have done so by restricting to particular classes of graphs. In 2017, Fox, Pach, Sheffer, Suk and Zahl proved better bounds for semialgebraic binary relations, and this work was extended by Do in
Mervyn Tong
wiley   +1 more source

Determinacy on the edge of second‐order arithmetic, I

open access: yesJournal of the London Mathematical Society, Volume 113, Issue 3, March 2026.
Abstract This is the first of two articles on the strength of m$m{}$‐Σ30$\bm{\Sigma }^0_3{}$‐determinacy for m∈N$m\in \mathbb {N}$, the strongest theories of determinacy contained in Hilbert's second‐order arithmetic (Z2)$(Z_2)$. In this article, we refute two natural conjectures on the strength of these principles in terms of inductive definability ...
J. P. Aguilera, P. D. Welch
wiley   +1 more source

The local $h$-vector of the cluster subdivision of a simplex [PDF]

open access: yes, 2012
The cluster complex $\Delta (\Phi)$ is an abstract simplicial complex, introduced by Fomin and Zelevinsky for a finite root system $\Phi$. The positive part of $\Delta (\Phi)$ naturally defines a simplicial subdivision of the simplex on the vertex set of
Athanasiadis, Christos A.   +1 more
core   +2 more sources

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

open access: yes, 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

Scattering theory for difference equations with operator coefficients

open access: yesJournal of the London Mathematical Society, Volume 113, Issue 3, March 2026.
Abstract We investigate a class of second‐order difference equations featuring operator‐valued coefficients with the aim of approaching problems of stationary scattering theory. We focus on various compact perturbations of the discrete Laplacian given in a Hilbert space of bi‐infinite square‐summable sequences with entries from a fixed Hilbert space ...
David Sher   +3 more
wiley   +1 more source

History of Catalan numbers [PDF]

open access: yes, 2014
We give a brief history of Catalan numbers, from their first discovery in the 18th century to modern times. This note will appear as an appendix in Richard Stanley's forthcoming book on Catalan numbers.Comment: 10 ...
Pak, Igor
core   +1 more source

Coloring and density theorems for configurations of a given volume

open access: yesProceedings of the London Mathematical Society, Volume 132, Issue 3, March 2026.
Abstract This is a treatise on finite point configurations spanning a fixed volume to be found in a single color‐class of an arbitrary finite (measurable) coloring of the Euclidean space Rn$\mathbb {R}^n$, or in a single large measurable subset A⊆Rn$A\subseteq \mathbb {R}^n$.
Vjekoslav Kovač
wiley   +1 more source

C-Finite Sequences and Riordan Arrays

open access: yesMathematics
Many prominent combinatorial sequences, such as the Fibonacci, Lucas, Pell, Jacobsthal and Tribonacci sequences, are defined by homogeneous linear recurrence relations with constant coefficients.
Donatella Merlini
doaj   +1 more source

Home - About - Disclaimer - Privacy