Results 91 to 100 of about 125 (122)

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

Representation theory methods in extremal combinatorics

2016
The research of this thesis lies in the area of extremal combinatorics. The word "extremal" comes from the kind of problems that are studied in this field. In fact, if a collection of finite objects (numbers, subsets, subspaces, graphs, etc.) satisfies some restrictions then the following questions are of interest from the perspective of extremal ...
openaire   +2 more sources

Extremal Combinatorics in Geometry and Graph Theory

2013
We study a problem in extremal geometry posed by Paul Erdos and George Szekeres in 1935. This problem is to find the smallest positive integer N(n) such that every point set in general position (no three on a line) of N(n) points contains the vertex set of a convex n-gon.
openaire   +1 more source

Problems in Coding Theory and Extremal Combinatorics

2020
This dissertation consists of ?five papers whose subjects are mostly disjoint. Below are their abstracts and citation information.On a fractional version of Haemers' bound. In this note, we present a fractional version of Haemers' bound on the Shannon capacity of a graph, which is originally due to Blasiak.
openaire   +1 more source

Liquid Metal Combinatorics toward Materials Discovery

Advanced Materials, 2023
Wei Rao
exaly  

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

Polyhedral methods applied to extremal combinatorics problems

2014
Wir untersuchen Polytope, die zwei bekannte Probleme beschreiben: das Hypergraphen-Problem von Turán und die Vermutung von Frankl. Das Hypergraphen-Problem von Turán bestimmt die maximale Anzahl der r-Kanten in einem r-Hypergraph mit n Knoten, so dass der daraus entstandene r-Teil-Hypergraph keine Clique der Größe a enthält.
openaire   +2 more sources

Abelian combinatorics on words: A survey

Computer Science Review, 2023
Gabriele Fici
exaly  

Symmetry, Combinatorics, Artificial Intelligence, Music and Spectroscopy

Symmetry, 2021
Krishnan Balasubramanian
exaly  

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