相关论文: The combinatorics of Borel covers
We prove general results about completeness of cotorsion theories and existence of covers and envelopes in locally presentable abelian categories, extending the well-established theory for module categories and Grothendieck categories.…
We determine all values of the parameters for which the cell modules form a standard system, for a class of cellular diagram algebras including partition, Brauer, walled Brauer, Temperley-Lieb and Jones algebras. For this, we develop and…
We introduce in this section an Algebraic and Combinatorial approach to the theory of Numbers. The approach rests on the observation that numbers can be identified with familiar combinatorial objects namely rooted trees, which we shall here…
We describe a classification of degree n complex coefficient polynomials with respect to combinatorial patterns that arise from the two real algebraic curves obtained as the zero sets for their real and imaginary part. In particular, we…
Boykin and Jackson recently introduced a property of countable Borel equivalence relations called Borel boundedness, which they showed is closely related to the union problem for hyperfinite equivalence relations. In this paper, we…
In this note, we present a characterization of sets definable in Skolem arithmetic, i.e., the first-order theory of natural numbers with multiplication. This characterization allows us to prove the decidability of the theory. The idea is…
Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We…
Several results about the union-closed sets conjecture are presented.
The notion of computable reducibility between equivalence relations on the natural numbers provides a natural computable analogue of Borel reducibility. We investigate the computable reducibility hierarchy, comparing and contrasting it with…
This is a continuation of our combinatorial program on the enumeration of Borel orbits in symmetric varieties of classical types. Here, we determine the generating series the numbers of Borel orbits in…
An axiomatic approach to the representation theory of Coxeter groups and their Hecke algebras was presented in [1]. Combinatorial aspects of this construction are studied in this paper. In particular, the symmetric group case is…
This chapter combines an introduction and research survey about Schubert varieties. The theme is to combinatorially classify their singularities using a family of polynomial ideals generated by determinants.
Using standard methods (due to Janson, Stein-Chen, and Talagrand) from probabilistic combinatorics, we explore the following general theme: As one progresses from each member of a family of objects ${\cal A}$ being "covered" by at most one…
The notion of generalized Bell numbers has appeared in several works but there is no systematic treatise on this topic. In this paper we fill this gap. We discuss the most important combinatorial, algebraic and analytic properties of these…
This paper describes the homology of various simplicial complexes associated to set families from combinatorial number theory, including primitive sets, pairwise coprime sets, product-free sets, and coprime-free sets. We present a condition…
In this paper some results on the topology of the space of $k$-flats in $\mathbb R^n$ are proved, similar to the Borsuk-Ulam theorem on coverings of sphere. Some corollaries on common transversals for families of compact sets in $\mathbb…
We show that the category of countable Borel equivalence relations (CBERs) is dually equivalent to the category of countable $\mathcal{L}_{\omega_1\omega}$ theories which admit a one-sorted interpretation of a particular theory we call…
We introduce the bicategory of bialgebras with coverings (which can be thought of as coalgebra-indexed families of morphisms), and provide a motivating application to the transfer of formulas for primitives and antipode. Additionally, we…
We extend the the combinatorics of tableaux to the study of diagram algebras and give a uniform construction of their quasi-hereditary covers.
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…