Related papers: Algorithmic randomness and Ramsey properties of co…
Homogenization is a powerful way of taming a class of finite structures with several interesting applications in different areas, from Ramsey theory in combinatorics to constraint satisfaction problems (CSPs) in computer science, through…
Autostackability for finitely presented groups is a topological property of the Cayley graph combined with formal language theoretic restrictions, that implies solvability of the word problem. The class of autostackable groups is known to…
In this paper, we consider the probability that a randomly chosen automorphism of a finite group fixes a randomly chosen element of a subgroup of that group. We obtain several new results as well as generalizations and improvements of some…
We analyze statistical properties of the complex system with conditions which manifests through specific constraints on the column/row sum of the matrix elements. The presence of additional constraints besides symmetry leads to new…
Given a countable set S of positive reals, we study finite-dimensional Ramsey-theoretic properties of the countable ultrametric Urysohn space with distances in S.
Clustering problems are fundamental to unsupervised learning. There is an increased emphasis on fairness in machine learning and AI; one representative notion of fairness is that no single demographic group should be over-represented among…
In 2003, Kechris, Pestov and Todorcevic showed that the structure of certain separable metric spaces - called ultrahomogeneous - is closely related to the combinatorial behavior of the class of their finite metric spaces. The purpose of the…
In these lectures we discuss some elementary concepts in connection with the theory of symmetric spaces applied to ensembles of random matrices. We review how the relationship between random matrix theory and symmetric spaces can be used in…
We study automorphism groups of sparse graphs from the viewpoint of topological dynamics and the Kechris, Pestov, Todor\v{c}evi\'c correspondence. We investigate amenable and extremely amenable subgroups of these groups using the space of…
Automatic structures are infinite structures that are finitely represented by synchronized finite-state automata. This paper concerns specifically automatic structures over finite words and trees (ranked/unranked). We investigate the…
We examine properties of random numerical semigroups under a probabilistic model inspired by the Erdos-Renyi model for random graphs. We provide a threshold function for cofiniteness, and bound the expected embedding dimension, genus, and…
This work starts from definition of randomness, the results of algorithmic randomness are analyzed from the perspective of application. Then, the source and nature of randomness is explored, and the relationship between infinity and…
In this paper we prove that the automorphism groups of certain countable generic structures are not amenable. For doing that, we first prove the existence of particular matrices that do not satisfy the convex Ramsey condition. For a pair of…
Random matrix theory is a well-developed area of probability theory that has numerous connections with other areas of mathematics and its applications. Much of the literature in this area is concerned with matrices that possess many exact…
Building on Kadeishvili's original theorem inducing $A_\infty$-algebra structures on the homology of dg-algebras, several directions of algorithmic research in $A_\infty$-algebras have been pursued. In this paper we will survey work done on…
Ramsey algebras are algebras that induce Ramsey spaces, which are generalizations of the Ellentuck space and Milliken's space. Previous work suggests a possible local version of Ramsey algebras induced by infinite sequences. Hence, we…
Random tilings are interesting as idealizations of atomistic models of quasicrystals and for their connection to problems in combinatorics and algorithms. Of particular interest is the tiling entropy density, which measures the relation of…
The spectral moments of ensembles of sparse random block matrices are analytically evaluated in the limit of large order. The structure of the sparse matrix corresponds to the Erd\"os-Renyi random graph. The blocks are i.i.d. random…
There is a long history of studying Ramsey theory using the algebraic structure of Stone-Cech compactification of discrete semigroup. It has been shown that various Ramsey theoretic structures are contained in different algebraic large…
Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…