Related papers: A Ramsey Algebraic Study of Matrices
We study, in the context of algorithmic randomness, the closed amenable subgroups of the symmetric group $S_\infty$ of a countable set. In this paper we address this problem by investigating a link between the symmetries associated with…
The purpose of this paper is to introduce the idea of triangular Ramsey numbers and provide values as well as upper and lower bounds for them. To do this, the combinatorial game Mines is introduced; after some necessary theorems about…
One of the prime motivation for topology was Homotopy theory, which captures the general idea of a continuous transformation between two entities, which may be spaces or maps. In later decades, an algebraic formulation of topology was…
Physical systems exhibiting stochastic or chaotic behavior are often amenable to treatment by random matrix models. In deciding on a good choice of model, random matrix physics is constrained and guided by symmetry considerations. The…
We resolve a conjecture of Cooper-Fenner-Purewal that a certain sequence of combinatorial matrices which can be used to bound small product-Ramsey numbers is positive semidefinite. Because the connection to Ramsey Theory involves solving…
In this paper we are interested in the existence of small and big Ramsey degrees of classes of finite unary algebras in arbitrary (not necessarily finite) algebraic language $\Omega$. We think of unary algebras as $M$-sets where $M =…
In a seminal paper from 1983, Burr and Erdos started the systematic study of Ramsey numbers of cliques vs. large sparse graphs, raising a number of problems. In this paper we develop a new approach to such Ramsey problems using a mix of the…
Fold maps are higher dimensional versions of Morse functions and fundamental and important tools in studying algebraic and differential topological properties of manifolds: as the theory established by Morse and the higher dimensional…
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively studied k-server problem. The proof is based on Ramsey-type…
We provide a further analysis of the class of positive maps proposed ten years ago by Kossakowski. In particular we propose a new parametrization which reveals an elegant geometric structure and an interesting interplay between group theory…
The Hamiltonian description for a wide class of mechanical systems, having local symmetry transformations depending on time derivatives of the gauge parameters of arbitrary order, is constructed. The Poisson brackets of the Hamiltonian and…
In this thesis, we investigate the computational content and the logical strength of Ramsey's theorem and its consequences. For this, we use the frameworks of reverse mathematics and of computable reducibility. We proceed to a systematic…
For many years, there have been conducting research (e.g. by Bergelson, Furstenberg, Kojman, Kubi\'{s}, Shelah, Szeptycki, Weiss) into sequentially compact spaces that are, in a sense, topological counterparts of some combinatorial…
We show that Ramsey theory, a domain presently conceived to guarantee the existence of large homogeneous sets for partitions on k-tuples of words (for every natural number k) over a finite alphabet, can be extended to one for partitions on…
The amoebas associated to algebraic varieties are certain concave regions in the Euclidean space whose shape reminds biological amoebas. This term was formally introduced to Mathematics in 1994 by Gelfand, Kapranov and Zelevinski. Some…
Almost any reasonable class of finite relational structures has the Ramsey property or a precompact Ramsey expansion. In contrast to that, the list of classes of finite algebras with the precompact Ramsey expansion is surprisingly short. In…
In recent years, there has been much progress in the field of structural Ramsey theory, in particular in the study of big Ramsey degrees. In all known examples of infinite structures with finite big Ramsey degrees, there is in fact a single…
Dyson's (1962) classification of matrix ensembles is reviewed from a modern perspective, and its recent extension to disordered fermion problems is motivated and described. It is explained in particular why symmetry classes are associated…
Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…
This article discusses some recent trends in Ramsey theory on infinite structures. Trees and their Ramsey theory have been vital to these investigations. The main ideas behind the author's recent method of trees with coding nodes are…