Related papers: Sparse generalised polynomials
Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…
We study the conditional distribution of zeros of a Gaussian system of random polynomials (and more generally, holomorphic sections), given that the polynomials or sections vanish at a point p (or a fixed finite set of points). The…
In this paper, we present a generic parametrization of generically zero-dimensional parametric polynomial systems. More specifically, we study the specialization properties of the Rational Univariate Representation and derive bounds on the…
High-dimensional real-world systems can often be well characterized by a small number of simultaneous low-complexity interactions. The analysis of variance (ANOVA) decomposition and the anchored decomposition are typical techniques to find…
Graphons have traditionally served as limit objects for dense graph sequences, with the cut distance serving as the metric for convergence. However, sparse graph sequences converge to the trivial graphon under the conventional definition of…
Recently, the functional equation \[ \sum_{i=0}^mf_i(b_ix+c_iy)= \sum_{i=1}^na_i(y)v_i(x) \] with $x,y\in\mathbb{R}^d$ and $b_i,c_i\in\mathbf{GL}_d(\mathbb{C})$, was studied by Almira and Shulman, both in the classical context of continuous…
We study asymptotic zero distribution of random Laurent polynomials whose support are contained in dilates of a fixed integral polytope $P$ as their degree grow. We consider a large class of probability distributions including the ones…
A simple sparse coding mechanism appears in the sensory systems of several organisms: to a coarse approximation, an input $x \in \R^d$ is mapped to much higher dimension $m \gg d$ by a random linear transformation, and is then sparsified by…
We establish a so-called counting lemma that allows embeddings of certain linear uniform hypergraphs into sparse pseudorandom hypergraphs, generalizing a result for graphs [Embedding graphs with bounded degree in sparse pseudorandom graphs,…
We introduce the notion of the generalized-analytical function of the poly-number variable, which is a non-trivial generalization of the notion of analytical function of the complex variable and, therefore, may turn out to be fundamental in…
Graphons are limit objects of sequences of graphs and are used to analyze the behavior of large graphs. Recently, graphon signal processing has been developed to study signal processing on large graphs. A major limitation of this approach…
In [Jalowy, Kabluchko, Marynych, arXiv:2504.11593v1, 2025], the authors discuss a user-friendly approach to determine the limiting empirical zero distribution of a sequence of real-rooted polynomials, as the degree goes to $\infty$. In this…
In this paper, generalized Bell polynomials $(\Be_n^\phi)_n$ associated to a sequence of real numbers $\phi=(\phi_i)_{i=1}^\infty$ are introduced. Bell polynomials correspond to $\phi_i=0$, $i\ge 1$. We prove that when $\phi_i\ge 0$, $i\ge…
Solving systems of polynomial equations is a central problem in nonlinear and computational algebra. Since Buchberger's algorithm for computing Gr\"obner bases in the 60s, there has been a lot of progress in this domain. Moreover, these…
Schubert polynomials were discovered by A. Lascoux and M. Sch\"utzenberger in the study of cohomology rings of flag manifolds in 1980's. These polynomials generalize Schur polynomials, and form a linear basis of multivariate polynomials. In…
Toric (or sparse) elimination theory is a framework developped during the last decades to exploit monomial structures in systems of Laurent polynomials. Roughly speaking, this amounts to computing in a \emph{semigroup algebra}, \emph{i.e.}…
For an integer $ k\geq 2 $, let $ \{F^{(k)}_{n} \}_{n\geq 0}$ be the $ k$--generalized Fibonacci sequence which starts with $ 0, \ldots, 0, 1 $ ($ k $ terms) and each term afterwards is the sum of the $ k $ preceding terms. In this paper,…
Consider a regression model with fixed design and Gaussian noise where the regression function can potentially be well approximated by a function that admits a sparse representation in a given dictionary. This paper resorts to exponential…
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
We obtain a new lower bound on the size of value set f(F_p) of a sparse polynomial f in F_p[X] over a finite field of p elements when p is prime. This bound is uniform with respect of the degree and depends on some natural arithmetic…