Results 91 to 100 of about 2,178 (219)
Fine multidegrees, universal Gröbner bases, and matrix Schubert varieties
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract We give a criterion for a collection of polynomials to be a universal Gröbner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in (P1)N$(\mathbb {P}^1)^N$. This criterion can be used to give simple proofs of several existing results on universal Gröbner bases.
Daoji Huang, Matt Larson
wiley +1 more source
Abstract numeration systems and combinatorics on words [PDF]
, 2010 We summary the main properties of abstract numeration systems and their links to combinatorics on words and combinatorial game ...
Rigo, Michel
core
Note on decipherability of three-word codes
International Journal of Mathematics and Mathematical Sciences, 2002 The theory of uniquely decipherable (UD) codes has been widely developed in connection with automata theory, combinatorics on words, formal languages, and monoid theory.
F. Blanchet-Sadri, T. Howell
doaj +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
International Journal of Mathematical Combinatorics, Vol.6 [PDF]
, 2012 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
Some structures of the catalan numbers I [PDF]
ریاضی و جامعهThe Catalan numbers are ubiquitous in counting problems which is one of the primary reasons for its popularity. From various sources like books and Wikipedia we see that in combinatorial mathematics.
Daniel Yaqubi, Madjid Mirzavaziri
doaj +1 more source
Geometric Planted Matchings Beyond the Gaussian Model
Random Structures &Algorithms, Volume 68, Issue 4, July 2026.ABSTRACT We consider the problem of recovering an unknown matching between a set of n$$ n $$ randomly placed points in ℝd$$ {\mathbb{R}}^d $$ and random perturbations of these points. This can be seen as a model for particle tracking and more generally, entity resolution.
Lucas R. Schwengber, Roberto I. Oliveira
wiley +1 more source
Combinatorics on words: Christoffel words and repetitions in words [PDF]
, 2008 The two parts of this text are based on two series of lectures delivered by Jean Berstel and Christophe Reutenauer in March 2007 at the Centre de Recherches Mathématiques, Montréal, Canada.
Reutenauer, Christophe +3 more
core
Maximum Induced Trees and Forests of Bounded Degree in Random Graphs
Random Structures &Algorithms, Volume 68, Issue 4, July 2026.ABSTRACT The asymptotic behavior of the maximum sizes of induced trees and forests has been studied extensively in the last few decades, though the overall picture is far from being complete. In this paper, we close several significant gaps: (1) We prove 2‐point concentration of the maximum sizes of an induced forest and an induced tree with maximum ...
Margarita Akhmejanova +2 more
wiley +1 more source
Renormalization techniques for inflation systems and some of their applications
Acta Crystallographica Section A, Volume 82, Issue 4, Page 294-304, July 2026.In this work, renormalization methods for quantities related to the diffraction of inflation systems are surveyed.Exact renormalization techniques are important and powerful, particularly for inflation‐generated systems. We review recent results in this direction.
Michael Baake +4 more
wiley +1 more source