Related papers: Finite models, stability, and Ramsey's theorem
This paper investigates big Ramsey degrees of unrestricted relational structures in (possibly) infinite languages. Despite significant progress in the study of big Ramsey degrees, the big Ramsey degrees of many classes of structures with…
We prove a version of the fundamental theorems of Morse Theory in the setting of finite spaces or partially ordered sets. By using these results we extend Forman's discrete Morse theory to more general cell complexes and derive the…
This note investigate some finiteness properties of the category U of unstable modules. One shows finiteness properties for the injective resolution of finitely generated unstable modules. One also shows a stabilization result under…
In this paper we study the number of finite topologies on an $n$-element set subject to various restrictions.
This paper is the fourth and the last part of the series "Spherical higher order Fourier analysis over finite fields", aiming to develop the higher order Fourier analysis method along spheres over finite fields, and to solve the Geometric…
We extend a previously studied lattice model of particles with infinite repulsions to the case of finite energy interactions. The phase diagram is studied using grand canonical Monte Carlo simulation. Simulations of dynamical phenomena are…
The main results of this paper (a) extend the finite Ramsey partition theorem, and (b) employ this extension to obtain a stronger form of the infinite Nash-Williams partition theorem, and also a new proof of Ellentuck's, and hence…
Topological Ramsey theory studies a class of combinatorial topological spaces, known as topological Ramsey spaces, unifying the essential features of those combinatorial frames where the Ramsey property is equivalent to the Baire property.…
Finite groups with given systems of permuteral and strongly permuteral subgroups are studied. New characterizations of w-supersoluble and supersoluble groups are received.
This is an introduction to the finite groups, with focus on the groups of permutations and reflections, and more generally, on the finite groups of unitary matrices. We first discuss the basics of group theory, featuring the cyclic,…
In this paper we continue an earlier study of ends non-compact manifolds. The over-arching goal is to investigate and obtain generalizations of Siebenmann's famous collaring theorem that may be applied to manifolds having non-stable…
A new approach to superstability and finite time extinction of strongly continuous semigroups is presented, unifying known results and providing new criteria for these conditions to hold analogous to the well-known Pazy condition for…
We use the kernel category to give a finiteness condition for semigroups. As a consequence we provide yet another proof that finitely generated periodic semigroups of matrices are finite.
In an earlier paper \cite{yu2021Finiteness}, we showed that there are finitely many stationary configurations (consisting of equilibria, rigidly translating configurations, relative equilibria and collapse configurations) in the planar…
In this paper, we explain the importance of finite decomposition semigroups and present two theorems related to their structure.
We show that the relational theory of intersection types known as BCD has the finite model property; that is, BCD is complete for its finite models. Our proof uses rewriting techniques which have as an immediate by-product the polynomial…
We study delay-independent stability in nonlinear models with a distributed delay which have a positive equilibrium. Such models frequently occur in population dynamics and other applications. In particular, we construct a relevant…
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…
We both survey and extend a new technique from Lu Liu to prove separation theorems between products of Ramsey-type theorems over computable reducibility. We use this technique to show that Ramsey's theorem for $n$-tuples and three colors is…
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…