Pure O-Sequences and Matroid h-Vectors by Ha, Huy Tai, Stokes, Erik, Zanello, Fabrizio

Get full text

Parking on a random tree by Goldschmidt, C, Przykucki, M

“…Lackner and Panholzer proved (via analytic combinatorics methods) that there is a phase transition in this model. …”

Counting homomorphisms to square-free graphs, modulo 2 by Goldberg, L, Richerby, D, Goebel, A

“…These graphs arise frequently in combinatorics, for example in connection with the strong perfect graph theorem and in certain graph algorithms. …”

The sharp threshold for making squares by Balister, P, Bollobás, B, Morris, R

“…Our proof combines techniques from combinatorics, probability and analytic number theory; in particular, we use the so-called method of self-correcting martingales in order to control the size of the 2-core of the random hypergraph that encodes the prime factors of our random numbers. …”

A thirteenth-century theory of speech by Harvey, J, Smithson, H, Siviour, C, Gasper, G, Sonnesyn, S, McLeish, T, Howard, D

“…Through interdisciplinary analysis of the text, this paper finds a theory of vowel production and perception that is notably mathematical, with a formulation of vowel space rooted in combinatorics. Specifically, Grosseteste constructs a categorical space comprising three fundamental types of movements pertaining to the vocal apparatus: linear, circular, and dilational-constrictional; these correspond to similarity transformations of translation, rotation, and uniform scaling, respectively. …”

Concatenating bipartite graphs by Chudnovsky, M, Hompe, P, Scott, A, Seymour, P, Spirkl, S

On saturated k-Sperner systems by Morrison, N, Noel, J, Scott, A

Counting Homomorphisms to Square-Free Graphs, Modulo 2 by Gobel, A, Goldberg, L, Richerby, D

“…These graphs arise frequently in combinatorics, for example in connection with the strong perfect graph theorem and in certain graph algorithms. …”

On No-Three-In-Line Problem on m-Dimensional Torus by Ku, Cheng Yeaw, Wong, Kok Bin

Probability and random processes for electrical and computer engineers / by 356909 Therrien, Charles W., Tummala, Murali 311997

“…Chapters focus on the probability model, random variables and transformations, inequalities and limit theorems, random processes, and basic combinatorics. The author reinforces presentation of these and other topics using MATLAB computer projects that are available on the CRC Press website"--…”

Probability and random processes for electrical and computer engineers / by 356909 Therrien, Charles W., Tummala, Murali

Hodge-Deligne polynomials of character varieties of free abelian groups by Florentino Carlos, Silva Jaime

“…In the cases G=GL(n,C)G=GL\left(n,{\mathbb{C}}\hspace{-0.1em}) and SL(n,C)SL\left(n,{\mathbb{C}}\hspace{-0.1em}), we get even more concrete expressions for these polynomials, using the combinatorics of partitions.…”
Get full text

Finite-Repetition threshold for infinite ternary words by Golnaz Badkobeh, Maxime Crochemore

“…The question remains open for alphabets with more than four letters. Keywords: combinatorics on words, repetition, repeat, word powers, word exponent, repetition threshold, pattern avoidability, word morphisms.…”
Get full text

On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture by Julien Bensmail, Mohammed Senhaji, Kasper Szabo Lyngsie

Get full text

National Variability of German Language in Field of Lexical Compatibility (by Material of Austrian and Swiss Collocations) by L. B. Kopchuk

“…They are considered on the one hand as a basic phenomenon of lexical combinatorics, and on the other hand, as a special type of phraseological units, reflecting the features of all system levels of language or language variant. …”
Get full text

Gossiping with interference in radio ring networks by Jean-Claude Bermond, Takako Kodate, Joseph Yu

Get full text

Evolution of networks of protein domain organization by M. Fayez Aziz, Gustavo Caetano-Anollés

“…The evolutionary history of this molecular combinatorics has been studied with phylogenomic methods. …”
Get full text

Finite geometries: classical problems and recent developments by Joseph A. Thas

“…An exemplary example of research combining combinatorics, incidence geometry, Galois geometry and group theory is the determination of embeddings of generalized polygons in finite projective spaces. …”
Get full text

Exchange on dynamic encounter networks allows plant mitochondria to collect complete sets of mitochondrial DNA products despite their incomplete genomes by Konstantinos Giannakis, Joanna M. Chustecki, Iain G. Johnston

“…Using results from combinatorics, we identify the network statistics that determine this propensity, and discuss how features of mitochondrial dynamics observed in biology facilitate the collection of mtDNA-encoded gene products.…”
Get full text

EQUIVARIANT $K$ -THEORY OF GRASSMANNIANS by OLIVER PECHENIK, ALEXANDER YONG

“…Our work is based on the combinatorics of genomic tableaux and a generalization of Schützenberger’s [Combinatoire et représentation du groupe symétrique, in Actes Table Ronde CNRS, Univ. …”
Get full text