Results 171 to 180 of about 887,124 (211)
Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics
In this thesis, we consider several combinatorial topics, belonging to the areas appearing in the thesis title. Given a non-empty complete metric space $(X,d)$, a family of $n$ continuous maps $f_1,f_2,\dots,f_n\colon X\to X$ is a \emph{contractive family} if there exists $\lambda<1$ such that for any $x,y\in X$ we have $d(f_i(x),f_i(y))\leq\lambda ...
Luka Milićević
semanticscholar +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Algebraic, Extremal and Metric Combinatorics 1986
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.
Michel Deza +3 more
openalex +3 more sources
Sumsets, Zero-Sums and Extremal Combinatorics [PDF]
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
David J. Grynkiewicz
openalex +2 more sources
Extremal Combinatorics of Reaction Systems
2014Extremal combinatorics is the study of the size that a certain collection of objects must have in order to certainly satisfy a property. Reaction systems are a recent formalism for computation inspired by chemical reactions. This work is a first contribution to the study of the behaviour of large reaction systems by means of extremal combinatorics.
Dennunzio Alberto +2 more
openaire +4 more sources
The combinatorics and extreme value statistics of protein threading [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
John L. Spouge +2 more
openalex +2 more sources
Remark on one problem in extremal combinatorics
We reduce the problem of determining the maximum number of permutations of a finite set such that any pair of permutations has at least t common transpositions to the problem of determining the maximum number of permutations of finite set such that any pair has at least t common fixed points. The latter problem was solved by the author in [1].
Vladimir Blinovsky
openalex +2 more sources
Several problems in extremal combinatorics
2023In 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
Intersecting families of permutations and other problems in extremal combinatorics
This thesis is not available on this repository until the author agrees to make it public. If you are the author of this thesis and would like to make your work openly available, please contact us: thesis@repository.cam.ac.uk.
David Ellis
openalex +3 more sources
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk)
International Symposium on Mathematical Foundations of Computer Science, 2022F. Fomin +3 more
semanticscholar +1 more source

