Related papers: On some generalizations of the Halpern-L\"auchli t…
The Halpern-L\"auchli theorem, a combinatorial result about trees, admits an elegant proof due to Harrington using ideas from forcing. In an attempt to distill the combinatorial essence of this proof, we isolate various partition principles…
The classical Halpern-L\"auchli theorem states that for any finite coloring of a finite product of finitely branching perfect trees of height $\omega$, there exist strong subtrees sharing the same level set such that tuples consisting of…
We give a parametrization with perfect sets of the abstract Ellentuck theorem. The main tool for achieving this goal is a sort of parametrization of an abstract version of the Nash-Williams theorem. As corollaries, we obtain some known…
In this paper we prove a generalization of famous Larchr's theorem concerning good lattice points.
This paper presents a generalized version of a theorem of Grzegorek and Labuda in category bases and also endeavours to establish a variant formulation of the same in Marczewski structures.
In this paper we present the generalizations of results, given in the paper published in Georgian J. Math. 26(2019) no. 4, pp 591-598, towards point-finite families.
Several variants of the Halpern-L\"auchli Theorem for trees of uncountable height are investigated. For $\kappa$ weakly compact, we prove that the various statements are all equivalent. We show that the strong tree version holds for one…
Here we present ZFC theorems yielding the Halpern-L\a"uchli theorem and avoiding metamathematical notions in their formulations.
We generalize several classical theorems in extremal combinatorics by replacing a global constraint with an inequality which holds for all objects in a given class. In particular we obtain generalizations of Tur\'an's theorem, the…
We give an elementary proof of a generalization of Rokhlin's lemma for commuting non-invertible measure-preserving transformations, and we present several combinatorial applications.
First we introduce the Bailleul-Hoshino's result [4], which links the theory of regularity structures and the paracontrolled calculus. As an application of their result, we give another algebraic proof of the multicomponent commutator…
We develop a theory of reduction for generalized Kahler and hyper-Kahler structures which uses the generalized Riemannian metric in an essential way, and which is not described with reference solely to a single generalized complex…
We start with a bijective proof of Schur's theorem due to Alladi and Gordon and describe how a particular iteration of it leads to some very general theorems on colored partitions. These theorems imply a number of important results,…
We use standard constructions in algebraic geometry and homological algebra to extend the decomposition and hard Lefschetz theorems of T. Mochizuki and C. Sabbah so that they remains valid without the quasi-projectivity assumptions.
In this article, we obtain a non-uniform version of Hrushovski's generalisation of the Lang-Weil estimates using geometric methods.
We prove a general theorem on overpartitions with difference conditions that unifies generalisations of Schur's theorem due to Alladi-Gordon, Andrews, Corteel-Lovejoy and the author. This theorem also allows one to give companions and…
This paper continues a line of investigation of the Halpern--L\"{a}uchli Theorem at uncountable cardinals. We prove in ZFC that the Halpern--L\"{a}uchli Theorem for one tree of height $\kappa$ holds whenever $\kappa$ is strongly…
I connect an old result of mine on a Lie algebra generalization of the Amitsur-Levitski theorem with equations for sheets in a reductive Lie algebra and with recent results of Kostant-Wallach on the variety of singular elements in a…
We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…
A proof of Lagrange's and Jacobi's four-square theorem due to Hurwitz utilizes orders in a quaternion algebra over the rationals. Seeking a generalization of this technique to orders over number fields, we identify two key components: an…