Results 191 to 200 of about 9,033 (258)

On the theories classified by an étendue

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.
Abstract We give a model‐theoretic characterisation of the geometric theories classified by étendues—the ‘locally localic’ topoi. They are the theories where each model is determined, syntactically and semantically, by any witness of a fixed collection of formulae.
Joshua L. Wrigley
wiley   +1 more source

Affine hypersurfaces and superintegrable systems

open access: yesJournal of the London Mathematical Society, Volume 114, Issue 1, July 2026.
Abstract It was recently shown that under mild assumptions, second‐order conformally superintegrable systems can be encoded in a (0,3)‐tensor, called structure tensor. For abundant systems, this approach led to algebraic integrability conditions that essentially allow one to restore a system from the knowledge of its structure tensor in a point on the ...
Vicente Cortés, Andreas Vollmer
wiley   +1 more source

On exotic matrix exponential sums and Bessel–Speh functions

open access: yesJournal of the London Mathematical Society, Volume 114, Issue 1, July 2026.
Abstract In a previous work with Carmon, we defined Bessel–Speh functions. These are matrix coefficients of irreducible Speh representations of GLkc(F)$\mathrm{GL}_{kc}(\mathbb {F})$, where F$\mathbb {F}$ is a finite field. They arise from (k,c)$(k,c)$ models, which are models that generalize the Whittaker model to Speh representations attached to ...
Elad Zelingher
wiley   +1 more source

The Zarankiewicz problem on tripartite graphs

open access: yesJournal of the London Mathematical Society, Volume 114, Issue 1, July 2026.
Abstract In 1975, Bollobás, Erdős, and Szemerédi asked for the smallest τ$\tau$ such that an n×n×n$n \times n \times n$ tripartite graph with minimum degree n+τ$n + \tau$ must contain Kt,t,t$K_{t, t, t}$, conjecturing that τ=O(n1/2)$\tau = \mathcal {O}(n^{1/2})$ for t=2$t = 2$.
Francesco Di Braccio   +1 more
wiley   +1 more source

On Dedekind's problem, a sparse version of Sperner's theorem, and antichains of a given size in the Boolean lattice

open access: yesJournal of the London Mathematical Society, Volume 114, Issue 1, July 2026.
Abstract Dedekind's problem, dating back to 1897, asks for the total number ψ(n)$\psi (n)$ of antichains contained in the Boolean lattice Bn$B_n$ on n$n$ elements. We study Dedekind's problem using a recently developed method based on the cluster expansion from statistical physics, and as a result, obtain several new results on the number and typical ...
Matthew Jenssen   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy