Related papers: Sublacunary sets and interpolation sets for nilseq…
In the space of holomorphic functions in a convex domain it is studied the interpolation problem by means of sums of the series of exponentials converging uniformly on all compact sets of the domain. The discrete set of the interpolation…
The paper studies the interpolation properties of net spaces $N_{p,q}(M)$, when $M$ is the set of dyadic cubes in $\mathbb{R}^n$, and also when $M$ is the family of all cubes with parallel faces to the coordinate axes in $\mathbb{R}^n$. It…
It is a well known that, for odd $n$, the number of subsets of $\{1,2,\dots,n\}$ the sum of whose elements is divisible by $n$ equals the number of binary necklaces of length $n$. In this paper generalize this result in two directions. On…
Lekkerkerker and Boland characterized the minimal forbidden induced subgraphs for the class of interval graphs. We give a linear-time algorithm to find one in any graph that is not an interval graph. Tucker characterized the minimal…
Let $L\subset \mathbb{Z}^n$ be a lattice and $I_L=\langle x^{\bf u}-x^{\bf v}:\ {\bf u}-{\bf v}\in L\rangle$ be the corresponding lattice ideal in $\Bbbk[x_1,\ldots, x_n]$, where $\Bbbk$ is a field. In this paper we describe minimal…
In our previous work, On the localization of Hutchinson-Barnsley fractals, Chaos Solitons Fractals, 173 (2023), 113-674, we presented a method for finding a finite family of closed balls whose union contains the attractor of a given…
There has been a long history of works showing that neural networks have hard time extrapolating beyond the training set. A recent study by Balestriero et al. (2021) challenges this view: defining interpolation as the state of belonging to…
Sublinear circuits are generalizations of the affine circuits in matroid theory, and they arise as the convex-combinatorial core underlying constrained non-negativity certificates of exponential sums and of polynomials based on the…
This paper introduces a new subtraction operation for convex sets, which defines their difference as a collection of inclusion-minimal convex sets with appropriate definitions of linear operations on them. With these operations the set of…
Multilinear interpolation is a powerful tool used in obtaining strong type boundedness for a variety of operators assuming only a finite set of restricted weak-type estimates. A typical situation occurs when one knows that a multilinear…
A discrete set $A$ in the Euclidian space is almost periodic if the measure with the unite masses at points of the set is almost periodic in the weak sense. We investigate properties of such sets in the case when $A-A$ is discrete. In…
The classical straightening theorem as proved by Douady and Hubbard shows that a polynomial-like sequence is hybrid equivalent to a polynomial. We generalize this result to non-autonomous iteration where one considers composition sequences…
Let $X$ be an uncountable Polish space and let $\mathcal{I}$ be an ideal on $\omega$. A point $\eta \in X$ is an $\mathcal{I}$-limit point of a sequence $(x_n)$ taking values in $X$ if there exists a subsequence $(x_{k_n})$ convergent to…
We give a constructive and flexible proof of a result of P. Gorkin and R. Mortini concerning a special finite interpolation problem on the unit circle with interpolating Blaschke products. Our proof also shows that the result can be…
It is well known that the set of possible degree sequences for a graph on $n$ vertices is the intersection of a lattice and a convex polytope. We show that the set of possible degree sequences for a $k$-uniform hypergraph on $n$ vertices is…
We study symplectic (contact) structures on nilmanifolds that correspond to the filiform Lie algebras - nilpotent Lie algebras of the maximal length of the descending central sequence. We give a complete classification of filiform Lie…
A simple linear loop is a simple while loop with linear assignments and linear loop guards. If a simple linear loop has only two program variables, we give a complete algorithm for computing the set of all the inputs on which the loop does…
Given $E_0, E_1, F_0, F_1, E$ rearrangement invariant function spaces, $a_0$, $a_1$, $b_0$, $b_1$, $b$ slowly varying functions and $0< \theta_0<\theta_1<1$, we characterize the interpolation spaces $$(\overline{X}^{\mathcal…
Two closely related topics: higher order Bohr sets and higher order almost automorphy are investigated in this paper. Both of them are related to nilsystems. In the first part, the problem which can be viewed as the higher order version of…
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that can be represented as intersection graph of subpaths on a tree…