Results 131 to 140 of about 2,715,033 (227)

A characterization of substitutive sequences using return words [PDF]

Discrete Mathematics 179 (1998) 89-101, 2008
We prove that a sequence is primitive substitutive if and only if the set of its derived sequences is finite; we defined these sequences here.
arxiv  

Automated Discharging Arguments for Density Problems in Grids [PDF]

, 2014
Discharging arguments demonstrate a connection between local structure and global averages. This makes it an effective tool for proving lower bounds on the density of special sets in infinite grids.
Stolee, Derrick
core   +1 more source

Asymptotic expansions for enumerating connected labelled graphs [PDF]

arXiv, 2011
I compute several terms of the asymptotic expansion of the number of connected labelled graphs with n nodes and m edges, for small k=m-n.
arxiv  

Modern perspectives in Proof Theory. [PDF]

Philos Trans A Math Phys Eng Sci, 2023
Aguilera JP, Pakhomov F, Weiermann A.
europepmc   +1 more source

A bipartite graph with non-unimodal independent set sequence [PDF]

arXiv, 2013
We show that the independent set sequence of a bipartite graph need not be unimodal.
arxiv  

Lovasz' Conjecture and Other Applications of Topological Methods in Discrete Mathematics [PDF]

arXiv
In 20th century mathematics, the field of topology, which concerns the properties of geometric objects under continuous transformation, has proved surprisingly useful in application to the study of discrete mathematics, such as combinatorics, graph theory, and theoretical computer science.
arxiv  

Quasirandom Graphs and the Pantograph Equation. [PDF]

Am Math Mon, 2021
Shapira A, Tyomkyn M.
europepmc   +1 more source

Dataset complementary prism networks. [PDF]

Data Brief, 2023
Parra-Inza E, Sigarreta-Almira JM.
europepmc   +1 more source

Theory of combinatorial limits and extremal combinatorics [PDF]

In the past years, techniques from different areas of mathematics have been successfully applied in extremal combinatorics problems. Examples include applications of number theory, geometry and group theory in Ramsey theory and analytical methods to ...
Lopes Martins, Taísa
core  

Information Inequalities via Submodularity and a Problem in Extremal Graph Theory. [PDF]

Entropy (Basel), 2022
Sason I.
europepmc   +1 more source