Results 51 to 60 of about 211,771 (176)
Algebraic and geometric methods in enumerative combinatorics [PDF]
arXiv, 2014 A survey written for the upcoming "Handbook of Enumerative Combinatorics".
arxiv
Decomposition spaces in combinatorics [PDF]
, 2016 A decomposition space (also called unital 2-Segal space) is a simplicial object satisfying an exactness condition weaker than the Segal condition: just as the Segal condition expresses (up to homotopy) composition, the new condition expresses ...
Gálvez Carrillo, Maria Immaculada +2 more
core +1 more source
The combinatorics of splittability
, 2004 Marion Scheepers, in his studies of the combinatorics of open covers, introduced the property Split(U,V) asserting that a cover of type U can be split into two covers of type V. In the first part of this paper we give an almost complete classification of
Bartoszyński +13 more
core +3 more sources
On the Pre‐ and Post‐Positional Semi‐Random Graph Processes
Journal of Graph Theory, Volume 108, Issue 4, Page 819-831, April 2025.ABSTRACT We study the semi‐random graph process, and a variant process recently suggested by Nick Wormald. We show that these two processes are asymptotically equally fast in constructing a semi‐random graph G $G$ that has property P ${\mathscr{P}}$, for the following examples of P ${\mathscr{P}}$: (1) P ${\mathscr{P}}$ is the set of graphs containing ...
Pu Gao, Hidde Koerts
wiley +1 more source
Short survey about combinatorics on words and algorithmic methods in a ring (draft) [PDF]
arXiv, 2016 A short survey about combinatorics on words and algorithmic methods in a ring. Special attention is given to Shirshov's results. Adopted for undegraduate students.
arxiv
On a Question of Erdős and Nešetřil About Minimal Cuts in a Graph
Journal of Graph Theory, Volume 108, Issue 4, Page 817-818, April 2025.ABSTRACT Answering a question of Erdős and Nešetřil, we show that the maximum number of inclusion‐wise minimal vertex cuts in a graph on n $n$ vertices is at most 1.889 9 n $1.889{9}^{n}$ for large enough n $n$.
Domagoj Bradač
wiley +1 more source
The many faces of modern combinatorics [PDF]
arXiv, 2015 This is a survey of recent developments in combinatorics. The goal is to give a big picture of its many interactions with other areas of mathematics, such as: group theory, representation theory, commutative algebra, geometry (including algebraic geometry), topology, probability theory, and theoretical computer science.
arxiv
Combinatorics of Type D Exceptional Sequences [PDF]
arXiv, 2020 Exceptional sequences are important sequences of quiver representations in the study of representation theory of algebras. They are also closely related to the theory of cluster algebras and the combinatorics of Coxeter groups. We combinatorially classify exceptional sequences of a family of type D Dynkin quivers, and we show how our model for ...
arxiv
Relative cubulation of relative strict hyperbolization
Journal of the London Mathematical Society, Volume 111, Issue 4, April 2025.Abstract We prove that many relatively hyperbolic groups obtained by relative strict hyperbolization admit a cocompact action on a CAT(0)$\operatorname{CAT}(0)$ cubical complex. Under suitable assumptions on the peripheral subgroups, these groups are residually finite and even virtually special.
Jean‐François Lafont, Lorenzo Ruffoni
wiley +1 more source
Combinatorics of Chord Progressions [PDF]
, 2012 Color poster with text and diagrams.This study explored an overlap between combinatorics and music. The goal was to show chord progressions that are common to a specific collection of music, composer, or era.University of Wisconsin--Eau Claire Office of
Kiefer, Peter
core +1 more source