English
Related papers

Related papers: Joint diamonds and Laver diamonds

200 papers

Using a new technique, we prove a rich family of special cases of the matroid intersection conjecture. Roughly, we prove the conjecture for pairs of tame matroids which have a common decomposition by 2-separations into finite parts.

Combinatorics · Mathematics 2014-04-25 Nathan Bowler , Johannes Carmesin

In what follows we generalize the notion of a complemented ring to rings that are not necessarily reduced. We then determine how our concepts fit in with other well-known classes of rings.

Rings and Algebras · Mathematics 2026-05-27 P. Bhattacharjee , W. Wm. McGovern , Y. Zhou

The property of countable metacompactness of a topological space gets its importance from Dowker's 1951 theorem that the product of a normal space X with the unit interval is again normal iff X is countably metacompact. In a recent paper,…

Logic · Mathematics 2024-05-29 Rodrigo Carvalho , Tanmay Inamdar , Assaf Rinot

The cyclic sieving phenomenon provides a link between a polynomial analogue of Gauss congruence known as $q$-Gauss congruence, and a combinatorial analogue of Gauss congruence based on sequences of cyclic group actions. We strengthen this…

Combinatorics · Mathematics 2024-12-24 Fern Gossow

A remarkable result due to Kou, Liu & Luo states that the condition of continuity for a dcpo can be split into quasi-continuity and meet-continuity. Their argument contained a gap, however, which is probably why the authors of the monograph…

Logic in Computer Science · Computer Science 2016-07-08 Weng Kin Ho , Achim Jung , Dongsheng Zhao

This paper shows how to obtain the key concepts and notations of Garside theory by using the Composition--Diamond lemma. We also show in some cases the greedy normal form is exactly a Gr\"obner--Shirshov normal form and a family of a…

Rings and Algebras · Mathematics 2021-10-13 Viktor Lopatkin

In this note, we present a conjecture on intersections of set families, and a rephrasing of the conjecture in terms of principal downsets of Boolean lattices. The conjecture informally states that, whenever we can express the measure of a…

Combinatorics · Mathematics 2024-01-30 Antoine Amarilli , Mikaël Monet , Dan Suciu

The category of all monads over many-sorted sets (and over other "set-like" categories) is proved to have coequalizers and strong cointersections. And a general diagram has a colimit whenever all the monads involved preserve monomorphisms…

Logic in Computer Science · Computer Science 2014-09-15 Jiří Adámek

Club guessing principles were introduced by Shelah as a weakening of Jensen's diamond. Most spectacularly, they were used to prove Shelah's ZFC bound on the power of the first singular cardinal. These principles have found many other…

Logic · Mathematics 2025-01-29 Tanmay Inamdar , Assaf Rinot

Let $S$ be a semigroup. The elements $a,b\in S$ are called primarily conjugate if $a=xy$ and $b=yx$ for certain $x,y\in S$. The relation of conjugacy is defined as the transitive closure of the relation of primary conjugacy. In the case…

Group Theory · Mathematics 2007-05-23 Ganna Kudryavtseva

A concept of "guessability" is defined for sets of sequences of naturals. Eventually, these sets are thoroughly characterized. To do this, a nonstandard logic is developed, a logic containing symbols for the ellipsis as well as for…

Logic · Mathematics 2012-01-25 Samuel Alexander

The lottery preparation, a new general kind of Laver preparation, works uniformly with supercompact cardinals, strongly compact cardinals, strong cardinals, measurable cardinals, or what have you. And like the Laver preparation, the lottery…

Logic · Mathematics 2007-05-23 Joel David Hamkins

The celebrated union-closed conjecture is concerned with the cardinalities of various subsets of the Boolean $d$-cube. The cardinality of such a set is equivalent, up to a constant, to its measure under the uniform distribution, so we can…

Combinatorics · Mathematics 2025-11-05 Gabriel Gendler

We provide a proof of the union-closed sets conjecture, by means of a suitable refinement of the breakthrough entropy-approach introduced by Gilmer. The novelty here is to consider a convex combination of $A$ and $A\cup B$, where $A,B$ are…

Combinatorics · Mathematics 2023-02-09 Raffaele Scandone

Brawley and Carlitz introduced diamond products of elements of finite fields and associated composed products of polynomials in 1987. Composed products yield a method to construct irreducible polynomials of large composite degrees from…

Number Theory · Mathematics 2024-02-23 Lukas Kölsch , Lucas Krompholz , Gohar M. Kyureghyan

We give two results on guessing unbounded subsets of lambda^+. The first is a positive result and applies to the situation of lambda regular and at least equal to aleph_3, while the second is a negative consistency result which applies to…

Logic · Mathematics 2007-05-23 Mirna Džamonja , Saharon Shelah

Our original aim was, in Abelian group theory to prove the consistency of: lambda is strong limit singular and for some properties of abelian groups which are relatives of being free, the compactness in singular fails. In fact this should…

Logic · Mathematics 2013-06-25 Saharon Shelah

We show that the notions of generic and Laver-generic supercompactness are first-order definable in the language of ZFC. This also holds for generic and Laver-generic (almost) hugeness as well as for generic versions of other large…

Logic · Mathematics 2021-07-01 Sakaé Fuchino , Hiroshi Sakai

We prove several results giving lower bounds for the large cardinal strength of a failure of the singular cardinal hypothesis. The main result is the following theorem: Theorem: Suppose $\kappa$ is a singular strong limit cardinal and…

Logic · Mathematics 2016-09-06 Moti Gitik , William Mitchell

A modular or distributive lattice is `diamond-colored' if its order diagram edges are colored in such a way that, within any diamond of edges, parallel edges have the same color. Such lattices arise naturally in combinatorial representation…

Combinatorics · Mathematics 2022-05-10 Robert G. Donnelly