Results 171 to 180 of about 887,803 (201)

Several problems in extremal combinatorics

2023
In this thesis, we study several problems from combinatorial probability theory, discrete geometry and extremal graph theory. We establish several extremal results towards our problems. Some of the theorems extend or generalize previous results, and others resolve open problems in the literature.
openaire   +1 more source

Several problems in extremal and probabilistic combinatorics

2023
This thesis consists of four parts, each on a different problem in extremal or probabilistic combinatorics. Chapters 2 and 3 center around hypergraph versions of foundational problems in extremal combinatorics. Chapter 4 concerns algorithmic and structural results for a probabilistic model motivated by statistical physics, and Chapter 5 details the use
openaire   +1 more source

Remark on one problem in extremal combinatorics

Problems of Information Transmission, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Sumsets, Zero-Sums and Extremal Combinatorics

2006
This thesis develops and applies a method of tackling zero-sum additive questions, especially those related to the Erdos-Ginzburg-Ziv Theorem (EGZ), through the use of partitioning sequences into sets, i.e., set partitions. Much of the research can alternatively be found in the literature spread across nine separate articles, but is here collected into
openaire   +1 more source

Extremal Results in and out of Additive Combinatorics

2020
In this thesis, we study several related topics in extremal combinatorics, all tied together by various themes from additive combinatorics and combinatorial geometry. First, we discuss some extremal problems where local properties are used to derive global properties.
openaire   +1 more source

Problems in Discrete Geometry and Extremal Combinatorics

2016
We study several problems in discrete geometry and extremal combinatorics. Discrete geometry studies the combinatorial properties of finite sets of simple geometric objects. One theme of the field is geometric Ramsey theory. Given m geometric objects, we want to select a not too small subset forming a configuration that is “regular” in some sense.
openaire   +1 more source

Algebraic, Extremal and Metric Combinatorics 1986

1988
This book represents a comprehensive overview of the present state of progress in three related areas of combinatorics. It comprises selected papers from a conference held at the University of Montreal. Topics covered in the articles include association schemes, extremal problems, combinatorial geometrics and matroids, and designs.
openaire   +1 more source

Extremal problems in combinatorics and geometry

This thesis is comprised of four chapters relating to combinatorics and geometry. More specifically, the main topics of the dissertation are incidence geometry and Euclidean Ramsey theory. In Chapter 2, we study the Erdős unit distance problem. In particular, we prove a structural result for pointsets determining many unit distances from a small ...
openaire   +1 more source

Integrated Portable Shrimp-Freshness Prediction Platform Based on Ice-Templated Metal–Organic Framework Colorimetric Combinatorics and Deep Convolutional Neural Networks

ACS Sustainable Chemistry and Engineering, 2021
Zi Teng, Yaguang Luo, Cheng Gong
exaly  

Symmetry, Combinatorics, Artificial Intelligence, Music and Spectroscopy

Symmetry, 2021
Krishnan Balasubramanian
exaly