Related papers: New parameters of subsets in polynomial schemes
We study the decomposition of zero-dimensional persistence modules, viewed as functors valued in the category of vector spaces factorizing through sets. Instead of working directly at the level of vector spaces, we take a step back and…
Signature kernels have emerged as a powerful tool within kernel methods for sequential data. In the paper "The Signature Kernel is the solution of a Goursat PDE", the authors identify a kernel trick that demonstrates that, for continuously…
Optimal prefix codes are studied for pairs of independent, integer-valued symbols emitted by a source with a geometric probability distribution of parameter $q$, $0{<}q{<}1$. By encoding pairs of symbols, it is possible to reduce the…
A probabilistic secret sharing scheme is a joint probability distribution of the shares and the secret together with a collection of secret recovery functions. The study of schemes using arbitrary probability spaces and unbounded number of…
We study multivariate polynomials over `structured' grids. We begin by proposing an interpretation as to what it means for a finite subset of a field to be structured; we do so by means of a numerical parameter, the nullity. We then extend…
The concept of supersymmetry in a quantum mechanical system is extended, permitting the recognition of many more supersymmetric systems, including very familiar ones such as the free particle. Its spectrum is shown to be supersymmetric,…
Pellet's theorem determines when the zeros of a polynomial can be separated into two regions, according to their moduli. We refine one of those regions and replace it with the closed interior of a lemniscate that provides more precise…
We elucidate why an interval algorithm that computes the exact bounds on the amplitude and phase of the discrete Fourier transform can run in polynomial time. We address this question from a formal perspective to provide the mathematical…
In this paper, we are concerned with the problem of counting the multiplicities of a zero-dimensional regular set's zeros. We generalize the squarefree decomposition of univariate polynomials to the so-called pseudo squarefree decomposition…
Reducing the conditions under which a given set satisfies the stipulations of the subset sum proposition to a set of linear relationships, the question of whether a set satisfies subset sum may be answered in a polynomial number of steps by…
The generation of curves and surfaces from given data is a well-known problem in Computer-Aided Design that can be approached using subdivision schemes. They are powerful tools that allow obtaining new data from the initial one by means of…
Nonclassical symmetries and reductions of polynomial equations and systems of polynomial equations are considered. It is shown that specific polynomial equations having "hidden" symmetries can be reduced to classical symmetric systems of…
We discuss existence of explicit search bounds for zeros of polynomials with coefficients in a number field. Our main result is a theorem about the existence of polynomial zeros of small height over the field of algebraic numbers outside of…
We consider the distribution of spacings between consecutive elements in subsets of Z/qZ where q is highly composite and the subsets are defined via the Chinese remainder theorem. We give a sufficient criterion for the spacing distribution…
In this work we prove a version of the Sylvester-Gallai theorem for quadratic polynomials that takes us one step closer to obtaining a deterministic polynomial time algorithm for testing zeroness of $\Sigma^{[3]}\Pi\Sigma\Pi^{[2]}$…
Polynomial Systems, or at least their algorithms, have the reputation of being doubly-exponential in the number of variables [Mayr and Mayer, 1982], [Davenport and Heintz, 1988]. Nevertheless, the Bezout bound tells us that that number of…
The *reciprocal complement* $R(D)$ of an integral domain $D$ is the subring of its fraction field generated by the reciprocals of its nonzero elements. Many properties of $R(D)$ are determined when $D$ is a polynomial ring in $n\geq 2$…
In recent years, a lot of research was devoted to Simpson's rule for numerical integration. In the paper we study a natural successor of Simpson's rule, namely the Boole's rule. It is the Newton-Cotes formula in the case where the interval…
Let $R$ be a commutative ring with identity and let $I$ be an ideal of $R$. Let $R\Join I$ be the subring of $R\times R$ consisting of the elements $(r,r+i)$ for $r\in R$ and $i\in I$. We study the diameter and girth of the zero-divisor…
The Unbounded Subset-Sum Problem (USSP) is defined as: given sum $s$ and a set of integers $W\leftarrow \{p_1,\dots,p_n\}$ output a set of non-negative integers $\{y_1,\dots,y_n\}$ such that $p_1y_1+\dots+p_ny_n=s$. The USSP is an…