Related papers: New parameters of subsets in polynomial schemes
Definition of the number of prime numbers in the given interval
We define two finite q-analogs of certain multiple harmonic series with an arbitrary number of free parameters, and prove identities for these q-analogs, expressing them in terms of multiply nested sums involving the Gaussian binomial…
The zero-divisor graph of a finite commutative ring with unity is the graph whose vertex set is the set of zero-divisors in the ring, with $a$ and $b$ adjacent if $ab=0$. We show that the class of zero-divisor graphs is universal, in the…
Locating the zeros of quaternionic polynomials is a fundamental problem with significant implications across scientific and engineering disciplines, yet the noncommutative nature of quaternion multiplication makes it fundamentally more…
Let $D$ be a principal ideal domain with infinite spectrum such that for every nonzero prime ideal $M$ of $D$, the residue field $D/M$ is finite. Let $K$ be the quotient field of $D$. We investigate sets of lengths in the ring of…
This paper studies the notions of star and semistar operations over a polynomial ring. It aims at characterizing when every upper to zero in $R[X]$ is a $*$-maximal ideal and when a $*$-maximal ideal $Q$ of $R[X]$ is extended from $R$, that…
An M-sequence generated by a primitive polynomial has many interesting and desirable properties. A pseudo-random array is the two-dimensional generalization of an M-sequence. There are non-primitive polynomials all of whose non-zero…
In the present paper, we give a full description of the jet schemes of the polynomial ideal $\left( x_1\ldots x_n \right) \in k[x_1, \ldots, x_n]$ over a field of zero characteristic. We use this description to answer questions about…
In the present paper we generate binary pseudorandom sequences using generalized polynomials. A generalized polynomial is a function in whose description we not only allow addition and product (as it is the case in usual polynomials) but…
Mixed trigonometric-polynomials frequently occur in applications in physics, numerical analysis and engineering, the algorithm has been already proposed to determine its sign on (0,{pi}/2]. This paper proposes a procedure to extend the…
We consider the zeros of the sum of independent random polynomials as their degrees tend to infinity. Namely, let $p$ and $q$ be two independent random polynomials of degree $n$, whose roots are chosen independently from the probability…
This paper presents a framework for abstracting uncertain or non-polynomial components of dynamical systems using polynomial constraints. This enables the application of polynomial-based analysis tools, such as sum-of-squares programming,…
We prove some new results about the spacing between neighboring zeros of paraorthogonal polynomials on the unit circle. Our methods also provide new proofs of some existing results. The main tool we will use is a formula for the phase of…
This paper investigates asymptotic distribution of complex zeros of random polynomials $P_n(z):=\sum_{k=0}^{n}b(k)\xi_k z^k$, as $n\to\infty$, where $b$ is a regularly varying function at infinity with index $\alpha\in \mathbb{R}$ and…
An integral domain $R$ is \emph{perinormal} if every local going-down overring is a localization of $R$ and \emph{globally perinormal} if every going-down overring is a localization of $R$. In this paper, I introduce notions of graded…
Behaviour distances to measure the resemblance of two states in a (nondeterministic) fuzzy transition system have been proposed recently in the literature. Such a distance, defined as a pseudo-ultrametric over the state space of the model,…
We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…
To cater to the needs of (Zero Knowledge) proofs for (mathematical) proofs, we describe a method to transform formal sentences in 2x2-matrices over multivariate polynomials with integer coefficients, such that usual proof-steps like…
We compute the polynomial entropy of the induced maps on hyperspace for a homeomorphism $f$ of an interval or a circle with finitely many non-wandering points.
We introduce two graph polynomials and discuss their properties. One is a polynomial of two variables whose investigation is motivated by the performance analysis of the Bethe approximation of the Ising partition function. The other is a…