Related papers: Sublacunary sets and interpolation sets for nilseq…
A family of subsets of $[n]$ is intersecting if every pair of its sets intersects. Determining the structure of large intersecting families is a central problem in extremal combinatorics. Frankl-Kupavskii and Balogh-Das-Liu-Sharifzadeh-Tran…
The aim of this paper is to prove a general version of Pl\"unnecke's inequality. Namely, assume that for finite sets $A$, $B_1, ... B_k$ we have information on the size of the sumsets $A+B_{i_1}+... +B_{i_l}$ for all choices of indices…
A (vector space) basis B of a Lie algebra is said to be very nilpotent if all the iterated brackets of elements of B are nilpotent. In this note, we prove a refinement of Engel's Theorem. We show that a Lie algebra has a very nilpotent…
In the present paper we prove several results concerning the existence of low-discrepancy point sets with respect to an arbitrary non-uniform measure $\mu$ on the $d$-dimensional unit cube. We improve a theorem of Beck, by showing that for…
The system of coupled discrete equations describing a two-component superlattice with interlaced linear and nonlinear constituents is revisited as a basis for investigating binary waveguide arrays, such as ribbed AlGaAs structures, among…
This paper proves the minimum size of a supersequence over a set of eight elements is 52. This disproves a conjecture that the lower bound of the supersequence is the partial sum of the geometric Connell sequence. By studying the internal…
Call a finite relational structure $k$-Slupecki if its only surjective $k$-ary polymorphisms are essentially unary, and Slupecki if it is $k$-Slupecki for all $k \geq 2$. We present conditions, some necessary and some sufficient, for a…
It is well-known that every weakly convergent sequence in $\ell_1$ is convergent in the norm topology (Schur's lemma). Phillips' lemma asserts even more strongly that if a sequence $(\mu_n)_{n\in\mathbb N}$ in $\ell_\infty'$ converges…
A subset of positive integers $F$ is a Schreier set if it is non-empty and $|F|\leqslant \min F$ (here $|F|$ is the cardinality of $F$). For each positive integer $k$, we define $k\mathcal{S}$ as the collection of all the unions of at most…
We classify Borel-Schur algebras having finite representation type. We also de- termine Auslander-Reiten sequences for a large class of simple modules over Borel- Schur algebras. A partial information on the structure of the socles of…
We show that the closure of the value set of a real linear recurrence sequence is the union of a countable set and a finite collection of intervals. Conversely, any finite collection of closed intervals is the closure of the value set of…
Let $T$ be a measure preserving $\mathbb{Z}^\ell$-action on the probability space $(X,{\mathcal B},\mu),$ $q_1,\dots,q_m:{\mathbb R}\to{\mathbb R}^\ell$ vector polynomials, and $f_0,\dots,f_m\in L^\infty(X)$. For any $\epsilon > 0$ and…
Interpolation and approximation of functionals with conditionally positive definite kernels is considered on sets of centers that are not determining for polynomials. It is shown that polynomial consistency is sufficient in order to define…
Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…
Interpolation-based techniques become popular in recent years, as they can improve the scalability of existing verification techniques due to their inherent modularity and local reasoning capabilities. Synthesizing Craig interpolants is the…
If L is a complete ortholattice, f any partial function from L^n to L, then there is a complete ortholattice L* containing L as a subortholattice, and an ortholattice polynomial with coefficients in L* which represents f on L^n. Iterating…
We investigate dense lineability and spaceability of subsets of $\ell_\infty$ with a prescribed number of accumulation points. We prove that the set of all bounded sequences with exactly countably many accumulation points is densely…
Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each member of $\mathcal{A}$ intersects each member of $\mathcal{B}$. For any two integers $n$ and $k$ with $0 \leq k \leq n$, let ${[n] \choose \leq…
We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…
An $(n,k)$ sequence covering array is a set of permutations of $[n]$ such that each sequence of $k$ distinct elements of $[n]$ is a subsequence of at least one of the permutations. An $(n,k)$ sequence covering array is perfect if there is a…