Related papers: New parameters of subsets in polynomial schemes
This article investigates multiset dimensions in zero divisor graphs (ZD-graphs) associated with rings. Through rigorous analysis, we establish general bounds for the multiset dimension (Mdim) in ZD-graphs, exploring various commutative…
A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…
A \emph{2-interval} is the union of two disjoint intervals on the real line. Two 2-intervals $D_1$ and $D_2$ are \emph{disjoint} if their intersection is empty (i.e., no interval of $D_1$ intersects any interval of $D_2$). There can be…
For a prime $p$ and an integer $x$, the $p$-adic valuation of $x$ is denoted by $\nu_{p}(x)$. For a polynomial $Q$ with integer coefficients, the sequence of valuations $\nu_{p}(Q(n))$ is shown to be either periodic or unbounded. The first…
We study the zero location and the asymptotic behavior of iterated integrals of polynomials. Borwein-Chen-Dilcher's polynomials play an important role in this issue. For these polynomials we find their strong asymptotics and give the limit…
In this paper we consider 0-th order pseudodifferential operators on the circle. We show that inside any interval disjoint from critical values of the principal symbol, the spectrum is absolutely continuous with possibly finitely many…
We show that every polynomial overring of the ring ${\rm Int}(\mathbb Z)$ of polynomials which are integer-valued over $\mathbb Z$ may be considered as the ring of polynomials which are integer-valued over some subset of $\hat{\mathbb{Z}}$,…
This paper deals with properties of the algebraic variety defined as the set of zeros of a "typical" sequence of polynomials. We consider various types of "nice" varieties: set-theoretic and ideal-theoretic complete intersections,…
Bivariate P-polynomial association scheme of type $(\alpha,\beta)$ are defined as a generalization of the P-polynomial association schemes. This generalization is shown to be equivalent to a set of conditions on the intersection parameters.…
We consider interval estimation of the difference between two binomial proportions. Several methods of constructing such an interval are known. Unfortunately those confidence intervals have poor coverage probability: it is significantly…
For several computational procedures such as finding radicals and Noether normalizations, it is important to choose as sparse as possible a system of parameters in a polynomial ideal or modulo a polynomial ideal. We describe new strategies…
The algebraic characterization of dual univariate interpolating subdivision schemes is investigated. Specifically, we provide a constructive approach for finding dual univariate interpolating subdivision schemes based on the solutions of…
A computation method of algebraic local cohomology with parameters, associated with zero-dimensional ideal with parameter, is introduced. This computation method gives us in particular a decomposition of the parameter space depending on the…
We classify all post-critically finite unicritical polynomials defined over the maximal totally real algebraic extension of ${\mathbb Q}$. Two auxiliary results used in the proof of this result may be of some independent interest. The first…
As a generalization of orbit-polynomial and distance-regular graphs, we introduce the concept of a quotient-polynomial graph. In these graphs every vertex $u$ induces the same regular partition around $u$, where all vertices of each cell…
We give a strongly polynomial-time algorithm for integer linear programs defined by integer coefficient matrices whose subdeterminants are bounded by a constant and that contain at most two nonzero entries in each row. The core of our…
Assuming an integral quadratic polynomial with nonsingular quadratic part has a nontrivial zero on an integer lattice outside of a union of finite-index sublattices, we prove that there exists such a zero of bounded norm and provide an…
The Sum-of-Squares (SoS) hierarchy of semidefinite programs is a powerful algorithmic paradigm which captures state-of-the-art algorithmic guarantees for a wide array of problems. In the average case setting, SoS lower bounds provide strong…
The notion of multivariate $P$- and $Q$-polynomial association scheme has been introduced recently, generalizing the well-known univariate case. Numerous examples of such association schemes have already been exhibited. In particular, it…
Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possible candidates for large codes with efficient encoding and…