Related papers: On the finitizability problem in algebraic logic; …
We study the Erdos distance problem over finite Euclidean and non-Euclidean spaces. Our main tools are graphs associated to finite Euclidean and non-Euclidean spaces that are considered in Bannai-Shimabukuro-Tanaka (2004, 2007). These…
In recent work, comonads and associated structures have been used to analyse a range of important notions in finite model theory, descriptive complexity and combinatorics. We extend this analysis to Hybrid logic, a widely-studied extension…
Our work builds on known results for k-uniform hypergraphs including the existence of limits, a Regularity Lemma and a Removal Lemma. Our main tool here is a theory of measures on ultraproduct spaces which establishes a correspondence…
The present work presents some results about the categorial relation between logics and its categories of structures. A (propositional, finitary) logic is a pair given by a signature and Tarskian consequence relation on its formula algebra.…
This is a survey of old and new problems and results in additive number theory.
We prove the existence of infinitely many solutions to an elliptic problem by borrowing the techniques from algebraic topology. The solution(s) thus obtained will also be proved to be bounded.
We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…
We deal with equations over free semilattice of infinite rank and prove that any infinite consistent system of equations is equivalent to its finite subsystem. Moreover, we describe irreducible algebraic sets and solve some algorithmic…
Graph labellings have been a very fruitful area of research in the last four decades. However, despite the staggering number of papers published in the field (over 1000), few general results are available, and most papers deal with…
This paper is meant to be a short review and summary of recent results on the structure of finite and affine classical W-algebras, and the application of the latter to the theory of generalized Drinfeld-Sokolov hierarchies.
A complete classification and character formulas for finite-dimensional irreducible representations of the rational Cherednik algebra of type A is given. Less complete results for other types are obtained. Links to the geometry of affine…
We survey both old and new developments in the theory of algorithms in real algebraic geometry -- starting from effective quantifier elimination in the first order theory of reals due to Tarski and Seidenberg, to more recent algorithms for…
Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…
The finitistic dimension conjecture asserts that any finite-dimensional algebra over a field should have finite finitistic dimension. Recently, this conjecture is reduced to studying finitistic dimensions for extensions of algebras. In this…
This article is a survey of conjectures and results on reductive algebraic groups having good reduction at a suitable set of discrete valuations of the base field. Until recently, this subject has received relatively little attention, but…
The logico-algebraic study of Lewis's hierarchy of variably strict conditional logics has been essentially unexplored, hindering our understanding of their mathematical foundations, and the connections with other logical systems. This work…
We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…
The present survey aims at being a list of Conjectures and Problems in an area of model-theoretic algebra wide open for research, not a list of known results. To keep the text compact, it focuses on structures of finite Morley rank,…
We present the basic ideas of forms (a generalization of Ehresmann's sketches) and their theories and models, more explicitly than in previous expositions. Forms provide the ability to specify mathematical structures and data types in any…
We study s(k,n), the maximum size of A+A where A is a k-subset of [n]. A few known functions from additive number theory can be expressed via s(k,n). For example, our estimates of s(k,n) imply new bounds on the maximum size of quasi-Sidon…