相关论文: Finite models, stability, and Ramsey's theorem

We classify the homogeneous finite-dimensional permutation structures, i.e., homogeneous structures in a language of finitely many linear orders, giving a nearly complete answer to a question of Cameron, and confirming the classification…

In this paper we obtain bounds for integer solutions of quadratic polynomials in two variables that represent a natural number. Also we get some results on twin prime numbers. In addition, we use linear functionals to prove some results of…

This paper continues the development of the theory of finite localities that was begun in "Finite Localities I". The emphasis in this Part 2.

This paper deals with the Darcy-Forchheimer problem with two kinds of boundary conditions. We discretize the system by using the finite element methods and we propose two iterative schemes to solve the discrete problems. The well-posedness…

In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…

Finite mixture models have been a very important tool for exploring complex data structures in many scientific areas, for example, economics, epidemiology, finance. In the past decade, semiparametric techniques have been popularly…

In these notes we will survey recent results on various finitary approximation properties of infinite groups. We will discuss various restrictions on groups that are approximated for example by finite solvable groups or finite-dimensional…

The paper describes known and new results about finite difference calculus on configuration spaces. We describe finite difference geometry on configuration spaces, connect finite difference operators with cannonical commutation relations,…

Using the Carlson-Simpson theorem, we give a new general condition for a structure in a finite binary relational language to have finite big Ramsey degrees

We formulate and analyze several finiteness conjectures for linear algebraic groups over higher-dimensional fields. In fact, we prove all of these conjectures for algebraic tori as well as in some other situations. This work relies in an…

We prove a strong non-structure theorem for a class of metric structures with an unstable pair of formulae. As a consequence, we show that weak categoricity (that is, categoricity up to isomorphisms and not isometries) implies several…

Aiming to harmonise finite and infinite model reasoning, we initiate the study of partially finite models, where the reasoning task comes with a formula that specifies a part of the model that must be finite. We focus on the problem of…

The structure of groups for which certain sets of commutator subgroups are finite is investigated, with a particular focus on the relationship between these groups and those with finite derived subgroup.

In this note we study and obtain factorization theorems for colorings of matrices and Grassmannians over $\mathbb{R}$ and ${\mathbb{C}}$, which can be considered metric versions of the Dual Ramsey Theorem for Boolean matrices and of the…

In the first part of the thesis we construct models, called integrable, in which we can perform exact computations of physical quantities. We introduce several new out-of-equilibrium models that are obtained by solving, in specific cases,…

The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a…

In this note we establish a Ramsey-type result for certain subsets of the $n$-dimensional cube. This can then be applied to obtain reasonable bounds on various related structures, such as (partial) Hales-Jewett lines for alphabets of sized…

We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast…

We study Ramsey-theoretic properties of several natural classes of finite ultrametric spaces, describe the corresponding Urysohn spaces and compute a dynamical invariant attached to their isometry groups.

Ramsey's theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set H such that all n-element subsets of H have the same color. The strength of consequences of Ramsey's theorem has…