English
Related papers

Related papers: Lubell mass and induced partially ordered sets

200 papers

We introduce a coinductive version of the well-foundedness of N that is used in our proof within minimal logic of the constructive counterpart CLNP to the standard least number principle LNP. According to CLNP, an inhabited complemented…

Logic · Mathematics 2025-07-02 Iosif Petrakis

The union-closed sets conjecture, attributed to P\'eter Frankl from 1979, states that for any non-empty finite union-closed family of finite sets not consisting of only the empty set, there is an element that is in at least half of the sets…

Combinatorics · Mathematics 2023-06-08 Masoud Zargar

Let lambda be an infinite cardinal number and let C = {H_i| i in I} be a family of nontrivial groups. Assume that |I|<=lambda, |H_i|<= lambda, for i in I, and at least one member of C achieves the cardinality lambda. We show that there…

Group Theory · Mathematics 2008-02-07 Zoran Sunic

For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…

Category Theory · Mathematics 2007-05-23 Roman R. Zapatrin

The partition function is known to exhibit beautiful congruences that are often proved using the theory of modular forms. In this paper, we study the extent to which these congruence results apply to the generalized Frobenius partitions…

Number Theory · Mathematics 2018-09-05 Marie Jameson , Maggie Wieczorek

We prove a simple formula for arbitrary cluster variables in the marked surfaces model. As part of the formula, we associate a labeled poset to each tagged arc, such that the associated $F$-polynomial is a weighted sum of order ideals. Each…

Combinatorics · Mathematics 2024-04-19 Vincent Pilaud , Nathan Reading , Sibylle Schroll

Let $A$ be a subset of a finite field $\mathbb{F}$. When $\mathbb{F}$ has prime order, we show that there is an absolute constant $c > 0$ such that, if $A$ is both sum-free and equal to the set of its multiplicative inverses, then $|A| <…

Number Theory · Mathematics 2022-12-08 Katherine Benjamin

It was proved in 2009 that any partial Steiner triple system of order $u$ has an embedding of order $v$ for each admissible integer $v\geq 2u+1$. This result is best-possible in the sense that, for each $u\geq 9$, there exists a partial…

Combinatorics · Mathematics 2014-02-13 Daniel Horsley

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the meager ideal of the…

Logic · Mathematics 2007-05-23 Tomek Bartoszynski , Masaru Kada

We prove that there exist positive constants $C$ and $c$ such that for any integer $d \ge 2$ the set of ${\mathbf x}\in [0,1)^d$ satisfying $$ cN^{1/2}\le \left|\sum^N_{n=1}\exp\left (2 \pi i \left (x_1n+\ldots+x_d n^d\right)\right)…

Number Theory · Mathematics 2020-11-19 Changhao Chen , Bryce Kerr , James Maynard , Igor Shparlinski

Motivated by algebraic quantum field theory and our previous work we study properties of inductive systems of \ $C^*$-algebras over arbitrary partially ordered sets. A partially ordered set can be represented as the union of the family of…

Operator Algebras · Mathematics 2019-03-27 Renat Gumerov , Ekaterina Lipacheva , Tamara Grigoryan

We call a family $\mathcal{F}$ of subsets of $[n]$ $s$-saturated if it contains no $s$ pairwise disjoint sets, and moreover no set can be added to $\mathcal{F}$ while preserving this property (here $[n] = \{1,\ldots,n\}$). More than 40…

Combinatorics · Mathematics 2018-12-11 Matija Bucić , Shoham Letzter , Benny Sudakov , Tuan Tran

It is known that for an IP${^\star}$ set $A$ in $\mathbb{N}$ and a sequence $< x_{n}>_{n=1}^{\infty}$ there exists a sum subsystem $< y_{n}>_{n=1}^{\infty}$ of $< x_{n}>_{n=1}^{\infty}$ such that $FS(< y_n>_{n=1}^\infty)\cup FP(<…

Combinatorics · Mathematics 2014-09-23 Dibyendu De

We prove that for each finite field $\mathbb F$ and integer $k\in \mathbb Z$ there exists $n\in \mathbb Z$ such that no excluded minor for the class of $\mathbb F$-representable matroids has $n$ nested $k$-separations.

Combinatorics · Mathematics 2015-11-12 Shalev Ben-David , Jim Geelen

For a partially ordered set P, let Co(P) denote the lattice of all order-convex subsets of P. For a positive integer n, we denote by SUB(LO) (resp., SUB(n)) the class of all lattices that can be embedded into a product of lattices of convex…

General Mathematics · Mathematics 2007-05-23 Marina V. Semenova , Friedrich Wehrung

Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…

Logic · Mathematics 2020-06-02 Eliahu Levy

We consider families F of sequences converging to +infinity that F satisfies the following condition (C): (C): if an open set U in the real line is unbounded above then there exists a sequence belonging to F, which has an infinite number of…

Logic · Mathematics 2016-09-06 Apoloniusz Tyszka

Let $L/K$ be a Galois extension of number fields and let $G=\mathrm{Gal}(L/K)$. We show that under certain hypotheses on $G$, for a fixed prime number $p$, Leopoldt's conjecture at $p$ for certain proper intermediate fields of $L/K$ implies…

Number Theory · Mathematics 2026-03-24 Fabio Ferri , Henri Johnston

We prove that if G is a sufficiently large finite almost simple group of Lie type, then given a fixed nontrivial element x in G and a coset of G modulo its socle, the probability that x and a random element of the coset generate a subgroup…

Group Theory · Mathematics 2024-03-27 Jason Fulman , Daniele Garzoni , Robert M. Guralnick

A theorem of Galvin asserts that if the unordered pairs of reals are partitioned into finitely many Borel classes then there is a perfect set P such that all pairs from P lie in the same class. The generalization to n-tuples for n >= 3 is…

Logic · Mathematics 2016-09-06 Alain Louveau , Boban Veličković , Saharon Shelah