Results 11 to 20 of about 995,571 (241)

Probabilistic and extremal studies in additive combinatorics [PDF]

open access: hybrid, 2022
The results in this thesis concern extremal and probabilistic topics in number theoretic settings. We prove sufficient conditions on when certain types of integer solutions to linear systems of equations in binomial random sets are distributed normally, results on the typical approximate structure of pairs of integer subsets with a given sumset ...
Maximilian Wötzel
openalex   +5 more sources

Exploring implications of Trace (Inversion) formula and Artin algebras in extremal combinatorics [PDF]

open access: hybridApplicable Algebra in Engineering, Communication and Computing, 2023
This note is just a modest contribution to prove several classical results in Combinatorics from notions of Duality in some Artinian K -algebras (mainly through the Trace Formula), where K is a perfect field of characteristics not equal to 2.
Luis Miguel Pardo
openalex   +2 more sources

Fully Computer-Assisted Proofs in Extremal Combinatorics

open access: goldAAAI Conference on Artificial Intelligence, 2023
We present a fully computer-assisted proof system for solving a particular family of problems in Extremal Combinatorics. Existing techniques using Flag Algebras have proven powerful in the past, but have so far lacked a computational counterpart to ...
Olaf Parczyk   +3 more
openalex   +3 more sources

Substructure Densities in Extremal Combinatorics [PDF]

open access: yes, 2021
One of the primary goals of combinatorial mathematics is to understand how an object's properties are influenced by the presence or multiplicity of a given substructure. Over time, it has become popular to highlight the asymptotic behaviour of objects by
Timothy F. N. Chan
semanticscholar   +4 more sources

Problems and results in extremal combinatorics—II [PDF]

open access: bronzeDiscrete Mathematics, 2007
Extremal Combinatorics is among the most active topics in Discrete Mathematics, dealing with problems that are often motivated by questions in other areas, including Theoretical Computer Science and Information Theory. This paper contains a collection of problems and results in the area, including solutions or partial solutions to open problems ...
Noga Alon
openalex   +6 more sources

Birational contractions of $\overline{\mathrm{M}}_{0,n}$ and combinatorics of extremal assignments [PDF]

open access: greenarXiv, 2015
From Smyth's classification, modular compactifications of pointed smooth rational curves are indexed by combinatorial data, so-called extremal assignments. We explore their combinatorial structures and show that any extremal assignment is a finite union of atomic extremal assignments.
Han‐Bom Moon   +3 more
arxiv   +3 more sources

Problems and results in Extremal Combinatorics -- IV [PDF]

open access: greenarXiv, 2020
Extremal Combinatorics is among the most active topics in Discrete Mathematics, dealing with problems that are often motivated by questions in other areas, including Theoretical Computer Science and Information Theory. This paper contains a collection of problems and results in the area, including solutions or partial solutions to open problems ...
Noga Alon
arxiv   +3 more sources

Coloring and extremal problems in combinatorics

open access: bronze, 2010
Coloring problems concern partitions of structures. The classic problem of partitioning the set of integers into a finite number of pieces so that no one piece has an arithmetic progression of a fixed length was solved in 1927. Van der Waerden's Theorem shows that it is impossible to do so.
Jacob Manske
openalex   +4 more sources

Home - About - Disclaimer - Privacy