English
Related papers

Related papers: The ultrafilter and almost disjointness numbers

200 papers

An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called union-free if there are no three distinct sets in the family such that the union of two of the sets is equal to…

Combinatorics · Mathematics 2011-03-17 Jacob Fox , Choongbum Lee , Benny Sudakov

The starting point for this work is the family of functions $\overline{p}_{-t}(n)$ which counts the number of $t$--colored overpartitions of $n.$ In recent years, several infinite families of congruences satisfied by $\overline{p}_{-t}(n)$…

Number Theory · Mathematics 2024-05-30 James A. Sellers

In a recent article on overpartitions, Merca considered the auxiliary function $a(n)$ which counts the number of partitions of $n$ where odd parts are repeated at most twice (and there are no restrictions on the even parts). In the course…

Number Theory · Mathematics 2025-08-11 James A. Sellers

Given sets $\Phi_1=\{\phi_{11},...,\phi_{1u(1)}\}, ...,\Phi_{z}=\{\phi_{z1},...,\phi_{zu(z)}\}$ of boolean formulas, a formula $\omega$ follows from the conjunction $\bigwedge\Phi_i= \bigwedge \phi_{ij}$ iff $\neg \omega\wedge…

Logic in Computer Science · Computer Science 2011-09-06 Daniele Mundici , Claudia Picardi

In 2007 it was conjectured that the Constraint Satisfaction Problem (CSP) over a constraint language $\Gamma$ is tractable if and only if $\Gamma$ is preserved by a weak near-unanimity (WNU) operation. After many efforts and partial…

Computational Complexity · Computer Science 2020-05-05 Dmitriy Zhuk

We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…

Logic · Mathematics 2026-02-24 Anupam Das , Tikhon Pshenitsyn

In 1998 the second author proved that there is an $\epsilon>0$ such that every graph satisfies $\chi \leq \lceil (1-\epsilon)(\Delta+1)+\epsilon\omega\rceil$. The first author recently proved that any graph satisfying $\omega > \frac…

Discrete Mathematics · Computer Science 2012-11-08 Andrew D. King , Bruce A. Reed

We investigate families of subsets of $\omega$ with almost disjoint refinements in the classical case as well as with respect to given ideals on $\omega$. More precisely, we study the following topics and questions: 1) Examples of…

Logic · Mathematics 2015-10-21 Barnabás Farkas , Yurii Khomskii , Zoltán Vidnyánszky

Generalizing the proof for Sacks forcing, we show that the $h$-perfect tree forcing notions introduced by Goldstern, Judah and Shelah preserve selective independent families even when iterated. As a result we obtain new proofs of the…

Logic · Mathematics 2022-02-25 Corey Bacal Switzer

We prove that the strong polarized relation of $\theta$ above $\omega$ applied simultaneously for every cardinal in the interval $[\aleph_1,\aleph]$ is consistent. We conclude that this positive relation is consistent for every cardinal…

Logic · Mathematics 2018-04-24 Shimon Garti , Saharon Shelah

We prove the consistency of $\mathrm{add}(\mathcal{N})<\mathrm{cov}(\mathcal{N})<\mathfrak{p}=\mathfrak{g}=\mathfrak{s}<\mathrm{add}(\mathcal{M})=\mathrm{cof}(\mathcal{M})<\mathfrak{a}=\mathrm{non}(\mathcal{N})=\mathfrak{c}$ with ZFC where…

Logic · Mathematics 2019-08-15 Vera Fischer , Diego A. Mejía

In classical model theory, the Keisler--Shelah theorem establishes a fundamental connection between the elementary equivalence of structures and the isomorphism of their ultrapowers. Motivated by this, one may ask whether an analogous…

Operator Algebras · Mathematics 2026-05-14 Akihiko Arai

We give the first (ZFC) dividing line in Keisler's order among the unstable theories, specifically among the simple unstable theories. That is, for any infinite cardinal $\lambda$ for which there is $\mu < \lambda \leq 2^\mu$, we construct…

Logic · Mathematics 2012-08-13 M. Malliaris , S. Shelah

One method of constructing $(a^2+1, 2,a, 1)$-SEDFs (i.e., strong external difference families) in $\mathbb{Z}_{a^2+1}$ makes use of $\alpha$-valuations of complete bipartite graphs $K_{a,a}$. We explore this approach and we provide a…

Combinatorics · Mathematics 2024-06-14 Donald L. Kreher , Maura B. Paterson , Douglas R. Stinson

In this paper we give a conditional improvement to the Elekes-Szab\'{o} problem over the rationals, assuming the Uniformity Conjecture. Our main result states that for $F\in \mathbb{Q}[x,y,z]$ belonging to a particular family of…

Combinatorics · Mathematics 2020-10-20 Mehdi Makhul , Oliver Roche-Newton , Sophie Stevens , Audie Warren

The authors and Fischer recently proved that any hereditary property of two-dimensional matrices (where the row and column order is not ignored) over a finite alphabet is testable with a constant number of queries, by establishing the…

Combinatorics · Mathematics 2017-06-14 Noga Alon , Omri Ben-Eliezer

In this paper, we study the existence of solutions of the equation $(-\Delta)_1^s u=f$ in a bounded open set with Lipschitz boundary $\Omega\subset \Rn$, vanishing on $\Co \Omega$, for some given $s\in (0,1)$, and asymptotics as $p\to 1$ of…

Analysis of PDEs · Mathematics 2025-04-24 Claudia Bucur

We consider a family of linearly viscoelastic shells with thickness $2\varepsilon$, clamped along a portion of their lateral face, all having the same middle surface $S=\mathbf{\theta}(\bar{\omega})\subset \mathbb{R}^3$, where…

Analysis of PDEs · Mathematics 2020-03-09 Gonzalo Castiñeira , Ángel Rodríguez-Arós

We show that any family of subsets $A\subseteq 2^{[n]}$ satisfies $\lvert A\rvert \leq O\bigl(n^{\lceil{d}/{2}\rceil}\bigr)$, where $d$ is the VC dimension of $\{S\triangle T \,\vert\, S,T\in A\}$, and $\triangle$ is the symmetric…

Combinatorics · Mathematics 2018-06-21 Zeev Dvir , Shay Moran

The satisfiability problem for SPARQL patterns is undecidable in general, since the expressive power of SPARQL 1.0 is comparable with that of the relational algebra. The goal of this paper is to delineate the boundary of decidability of…

Databases · Computer Science 2016-06-03 Xiaowang Zhang , Jan Van den Bussche , François Picalausa