Related papers: Splitting families and complete separability
We show that there is an effectively closed maximal eventually different family of functions in spaces of the form $\prod_n F(n)$ for $F\colon \mathbb{N} \to \mathbb{N}\cup\{\mathbb{N}\}$ and give an exact criterion for when there exists an…
In this paper, we first give the definiton of a vertex superalgebroid. Then we construct a family of vertex superalgebras associated to vertex superalgebroids. As a main result, we find a sufficient and necessary condition that this vertex…
A collection of sets is {\em intersecting} if every two members have nonempty intersection. We describe the structure of intersecting families of $r$-sets of an $n$-set whose size is quite a bit smaller than the maximum ${n-1 \choose r-1}$…
A $\left(n,\ell,\gamma\right)$-sharing set family of size $m$ is a family of sets $S_1,\ldots,S_m\subseteq [n]$ s.t. each set has size $\ell$ and each pair of sets shares at most $\gamma$ elements. We let $m\left(n,\ell,\gamma\right)$…
We study the structure of arbitrary split Leibniz superalgebras. We show that any of such superalgebras ${\frak L}$ is of the form ${\frak L} = {\mathcal U} + \sum_jI_j$ with ${\mathcal U}$ a subspace of an abelian (graded) subalgebra $H$…
In the constructible universe, we construct a co-analytic maximal family of pairwise eventually different functions from $\mathbb{N}$ to $\mathbb{N}$ which remains maximal after adding arbitrarily many Sacks reals (by a countably supported…
Working in the context of restricted forms of the Axiom of Choice, we consider the problem of splitting the ordinals below $\lambda$ of cofinality $\theta$ into $\lambda$ many stationary sets, where $\theta < \lambda$ are regular cardinals.…
We prove that the union-closed sets conjecture is true for separating union-closed families $\mathcal{A}$ with $|\mathcal{A}| \leq 2\left(m+\frac{m}{\log_2(m)-\log_2\log_2(m)}\right)$ where $m$ denotes the number of elements in…
Under no additional assumptions, in this paper we construct a Ramsey expansion for every category of finite objects with finite small Ramsey degrees. Our construction is based on the relationship between small Ramsey degrees, weak…
In this article we study the notion of supermanifolds families, starting from Green's general classification of supermanifolds. The topics studied divide this article into two distinct parts, labelled I and II respectively. Part I concerns…
New splitting theorems in a semi-Riemannian manifold which admits an irrotational vector field (not necessarily a gradient) with some suitable properties are obtained. According to the extras hypothesis assumed on the vector field, we can…
Let $V$ be an $n$-dimensional vector space over the finite field $\mathbb{F} _{q} $, and ${V\brack k}$ denote the family of all $k$-dimensional subspaces of $V$. The families $\mathcal{F},\mathcal{G}\subseteq {V\brack k}$ are said to be…
A module is called absolutely indecomposable if it is directly indecomposable in every generic extension of the universe. We want to show the existence of large abelian groups that are absolutely indecomposable. This will follow from a more…
We investigate families of graphs and graphons (graph limits) that are defined by a finite number of prescribed subgraph densities. Our main focus is the case when the family contains only one element, i.e., a unique structure is forced by…
Motivated by recent results and questions of D. Raghavan and S. Shelah, we present ZFC theorems on the bounding and various almost disjointness numbers, as well as on reaping and dominating families on uncountable, regular cardinals. We…
Chv\'{a}tal conjectured that a star is amongst the largest intersecting subfamiles of a finite subset-closed family of sets. Kleitman later strengthened Chv\'{a}tal's conjecture, suggesting that maximal intersecting subfamilies of $2^{[n]}$…
The method of Murty and Cioab\u{a} shows how one can use results about gaps between primes to construct families of almost-Ramanujan graphs. In this paper we give a simpler construction which avoids the search for perfect matchings and thus…
New exact modular branching rules are obtained for modules over the symmetric groups that are close to completely splittable modules. These results are based on some upper bounds for the Ext^1-spaces between simple modules.
This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…
Let $n>s>0$ be integers, $X$ an $n$-element set and $\mathscr{A}, \mathscr{B}\subset 2^X$ two families. If $|A\cup B|\le s$ for all $A\in\mathscr{A}, B\in \mathscr{B}$, then $\mathscr{A}$ and $\mathscr{B}$ are called cross $s$-union.…