English
Related papers

Related papers: Almost $k$-union closed set systems

200 papers

We show that for any union-closed family $\mathcal{F} \subseteq 2^{[n]}, \mathcal{F} \neq \{\emptyset\}$, there exists an $i \in [n]$ which is contained in a $0.01$ fraction of the sets in $\mathcal{F}$. This is the first known constant…

Combinatorics · Mathematics 2022-11-29 Justin Gilmer

The union-closed sets conjecture, also known as Frankl's conjecture, is a well-studied problem with various formulations. In terms of lattices, the conjecture states that every finite lattice $L$ with more than one element contains a…

Combinatorics · Mathematics 2025-03-04 Christopher Bouchard

K. Mahler introduced the concept of perfect systems in the general theory he developed for the simultaneous Hermite-Pade approximation of analytic functions. We prove that Nikishin systems are perfect providing, by far, the largest class of…

Complex Variables · Mathematics 2010-01-05 U. Fidalgo Prieto , G. Lopez Lagomasino

We study Graver test sets for families of linear multi-stage stochastic integer programs with varying number of scenarios. We show that these test sets can be decomposed into finitely many ``building blocks'', independent of the number of…

Optimization and Control · Mathematics 2007-05-23 Matthias Aschenbrenner , Raymond Hemmecke

The following is a 2008 conjecture of Abraham, Bonnet and Kubi\'s: [ABK Conjecture] Every well quasi order (wqo) is a countable union of better quasi orders (bqo). We obtain a partial progress on the conjecture, by showing that the class of…

Logic · Mathematics 2025-01-28 Uri Abraham , Robert Bonnet , Mirna Džamonja , Maurice Pouzet

We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…

Number Theory · Mathematics 2021-04-26 Peter J. Bradshaw , Brandon Hanson , Misha Rudnev

For $k\ge1$, a $k$-almost prime is a positive integer with exactly $k$ prime factors, counted with multiplicity. In this article we give elementary proofs of precise asymptotics for the reciprocal sum of $k$-almost primes. Our results match…

Number Theory · Mathematics 2022-01-31 Jonathan Bayless , Paul Kinlaw , Jared Duker Lichtman

The Hilbert function of a module over a positively graded algebra is of quasi-polynomial type (Hilbert--Serre). We derive an upper bound for its grade, i.e. the index from which on its coefficients are constant. As an application, we give a…

Commutative Algebra · Mathematics 2007-05-23 Winfried Bruns , Bogdan Ichim

We prove almost sure ergodic theorems for a class of systems called quasistatic dynamical systems. These results are needed, because the usual theorem due to Birkhoff does not apply in the absence of invariant measures. We also introduce…

Dynamical Systems · Mathematics 2016-06-29 Mikko Stenlund

The notion of almost centralizer and almost commutator are introduced and basic properties are established. They are used to study $\widetilde{\mathfrak M}\_c$-groups, i. e.groups for which every descending chain of centralizers each having…

Logic · Mathematics 2015-10-01 Nadja Hempel

We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…

Computational Complexity · Computer Science 2015-05-07 Cristian S. Calude , Damien Desfontaines

In this paper, we almost completely solve the existence of an almost resolvable cycle system with odd cycle length. We also use almost resolvable cycle systems as well as other combinatorial structures to give some new solutions to the…

Combinatorics · Mathematics 2017-10-10 L. Wang , S. Lu , H. Cao

We study the number of $s$-element subsets $J$ of a given abelian group $G$, such that $|J+J|\leq K|J|$. Proving a conjecture of Alon, Balogh, Morris and Samotij, and improving a result of Green and Morris, who proved the conjecture for $K$…

Combinatorics · Mathematics 2019-05-06 Marcelo Soares Campos

We investigate the complexity of approximately counting stable matchings in the $k$-attribute model, where the preference lists are determined by dot products of "preference vectors" with "attribute vectors", or by Euclidean distances…

Computational Complexity · Computer Science 2012-04-20 Prasad Chebolu , Leslie Ann Goldberg , Russell Martin

In this paper, we develop tools to establish almost sure stability of stochastic switched systems whose switching signal is constrained by an automaton. After having provided the necessary generalizations of existing results in the setting…

Optimization and Control · Mathematics 2022-08-26 Matteo Della Rossa , Raphaël M. Jungers

The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. Let $f(n,a)$ be the maximum number of sets in a…

Combinatorics · Mathematics 2020-04-14 Brianna Amaral , Lucien Dalton , Drew Polakowski , Annie Raymond , Bertram Thomas

The fundamental result of Li, Long, and Srinivasan on approximations of set systems has become a key tool across several communities such as learning theory, algorithms, computational geometry, combinatorics and data analysis. The goal of…

Machine Learning · Computer Science 2022-09-02 Mónika Csikós , Nabil H. Mustafa

The quasi-integrable KdV equation has been obtained from the corresponding deformation of the Hamiltonian for the usual KdV system. Following suitable gauge-fixing, it has been found that the quasi-conservation condition is satisfied and an…

Mathematical Physics · Physics 2017-05-01 Kumar Abhinav , Partha Guha

We prove that the commutator is stable in permutations endowed with the Hamming distance, that is, two permutations that almost commute are near two commuting permutations. Our result extends to $k$-tuples of almost commuting permutations,…

Group Theory · Mathematics 2016-08-08 Goulnara Arzhantseva , Liviu Paunescu

The Frankl or Union-Closed Sets conjecture states that for any finite union-closed family of sets $\mathcal{F}$ containing some nonempty set, there is some element $i$ in the ground set $U(\mathcal F) := \bigcup_{S \in \mathcal{F}} S$ of…

Combinatorics · Mathematics 2024-10-16 Jonad Pulaj , Kenan Wood