English
Related papers

Related papers: Generic Selective Independent Families

200 papers

In this paper, we introduce and study the iterates of the following family of functions $\varphi_k$ defined on natural numbers which exhibits nice properties. $$\varphi_k(x)=\left\lbrace \begin{array}{ll} x+k, & \mbox{ if $x$ is prime;}\\…

Number Theory · Mathematics 2024-12-31 Angsuman Das

Given an Abelian groups $G$, denote $\mu(G)$ the size of its largest sum-free subset and $f_{\max}(G)$ the number of maximal sum-free sets in $G$. Confirming a prediction by Liu and Sharifzadeh, we prove that all even-order $G\ne…

Combinatorics · Mathematics 2026-03-02 József Balogh , Ramon I. Garcia , Hong Liu , Ningyuan Yang

For a class of polynomials $f \in \mathbb{Z}[X]$, which in particular includes all quadratic polynomials, and also trinomials of some special form, we show that, under some natural conditions (necessary for quadratic polynomials), the set…

Number Theory · Mathematics 2020-09-25 László Mérai , Alina Ostafe , Igor E. Shparlinski

A geometric method for obtaining an infinite family of Cayley digraphs of constant density on finite Abelian groups is presented. The method works for any given degree and it is based on consecutive dilates of a minimum distance diagram…

Combinatorics · Mathematics 2021-04-23 F. Aguiló , M. A. Fiol , S. Pérez

A method is presented that makes it possible to embed a subgroup separable superintegrable system into an infinite family of systems that are integrable and exactly-solvable. It is shown that in two dimensional Euclidean or pseudo-Euclidean…

Mathematical Physics · Physics 2015-06-05 Daniel Lévesque , Sarah Post , Pavel Winternitz

Let $m(n)$ denote the maximum size of a family of subsets which does not contain two disjoint sets along with their union. In 1968 Kleitman proved that $m(n) = {n\choose m+1}+\ldots +{n\choose 2m+1}$ if $n=3m+1$. Confirming the conjecture…

Combinatorics · Mathematics 2017-11-30 Peter Frankl , Andrey Kupavskii

We answer Question~3.2 from Shelah \cite{Sh:666}: Given a maximal almost disjoint (mad) family $\mathcal A$ of size $\aleph_1$, we construct a forcing ${\mathbb Q}(\mathcal A)$ that has Axiom A, is ${}^\omega \omega$-bounding, preserves…

Logic · Mathematics 2015-02-23 Heike Mildenberger

We give a new proof that there are arbitrarily large indecomposable abelian groups; moreover, the groups constructed are absolutely indecomposable, that is, they remain indecomposable in any generic extension. However, any absolutely rigid…

Logic · Mathematics 2007-05-23 Paul C. Eklof , Saharon Shelah

A family $\mathcal{F}$ of subsets of $[n]=\{1,2,\ldots,n\}$ shatters a set $A \subseteq [n]$ if for every $A' \subseteq A$ there is an $F \in \mathcal{F}$ such that $F \cap A=A'$. We develop a framework to analyze $f(n,k,d)$, the maximum…

Combinatorics · Mathematics 2024-10-29 Noga Alon , Varun Sivashankar , Daniel G. Zhu

Let $\mathcal R$ be a $\Sigma^1_1$ binary relation and call a set $\mathcal R$-discrete iff no two distinct of its elements are $\mathcal R$-related. We show that in the extension of $\mathbf{L}$ by iterated Sacks forcing, there is a…

Logic · Mathematics 2025-10-28 David Schrittesser

Given a finite family F of linear forms with integer coefficients, and a compact abelian group G, an F-free set in G is a measurable set which does not contain solutions to any equation L(x)=0 for L in F. We denote by d_F(G) the supremum of…

Combinatorics · Mathematics 2011-09-15 Pablo Candela , Olof Sisask

We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the completability to the presence of some patterns (particular…

Information Theory · Computer Science 2026-01-01 Augustin Cosse

We study a parametrized family of strong maximal fractional operators. We prove their $L^p$ to $L^q$ boundedness for $1<p\le q<\infty$.

Classical Analysis and ODEs · Mathematics 2026-04-28 Zipeng Wang

We throw some light on the question: is there a MAD family (= a family of infinite subsets of N, the intersection of any two is finite) which is completely separable (i.e. any X subseteq N is included in a finite union of members of the…

Logic · Mathematics 2010-07-19 Saharon Shelah

The main result of the present paper is that $\mathfrak a_g$, the minimal size of maximal cofinitary group, can be of countable cofinality. To prove this we define a natural poset for adding a maximal cofinitary group of a given…

Logic · Mathematics 2013-10-14 Vera Fischer , Asger Törnquist

We mechanize, in the proof assistant Isabelle, a proof of the axiom-scheme of Separation in generic extensions of models of set theory by using the fundamental theorems of forcing. We also formalize the satisfaction of the axioms of…

Logic in Computer Science · Computer Science 2019-01-11 Emmanuel Gunther , Miguel Pagano , Pedro Sánchez Terraf

We answer a question from Raghavan and Stepr{\=a}ns' paper on weakly tight families by showing that $\mathfrak{s} = {\mathfrak{s}}_{\omega, \omega}$. Then we use this to construct a completely separable maximal almost disjoint family under…

Logic · Mathematics 2019-08-15 Heike Mildenberger , Dilip Raghavan , Juris Steprāns

We study maximal independent families (m.i.f.) in the projective hierarchy. We show that (a) the existence of a $\boldsymbol{\Sigma}^1_2$ m.i.f. is equivalent to the existence of a $\boldsymbol{\Pi}^1_1$ m.i.f., (b) in the Cohen model,…

Logic · Mathematics 2019-05-14 Jörg Brendle , Vera Fischer , Yurii Khomskii

We consider strong external difference families (SEDFs); these are external difference families satisfying additional conditions on the patterns of external diferences that occur, and were first defined in the context of classifying optimal…

Combinatorics · Mathematics 2016-11-18 Sophie Huczynska , Maura B. Paterson

This paper investigates the dimension theory of some families of continuous piecewise linear iterated function systems. For one family, we show that the Hausdorff dimension of the attractor is equal to the exponential growth rate obtained…

Dynamical Systems · Mathematics 2022-12-20 R. D. Prokaj , K. Simon