85 research outputs found
Discovering the roots: Uniform closure results for algebraic classes under factoring
Newton iteration (NI) is an almost 350 years old recursive formula that
approximates a simple root of a polynomial quite rapidly. We generalize it to a
matrix recurrence (allRootsNI) that approximates all the roots simultaneously.
In this form, the process yields a better circuit complexity in the case when
the number of roots is small but the multiplicities are exponentially
large. Our method sets up a linear system in unknowns and iteratively
builds the roots as formal power series. For an algebraic circuit
of size we prove that each factor has size at most a
polynomial in: and the degree of the squarefree part of . Consequently,
if is a -hard polynomial then any nonzero multiple
is equally hard for arbitrary positive 's, assuming
that is at most .
It is an old open question whether the class of poly()-sized formulas
(resp. algebraic branching programs) is closed under factoring. We show that
given a polynomial of degree and formula (resp. ABP) size
we can find a similar size formula (resp. ABP) factor in
randomized poly()-time. Consequently, if determinant requires
size formula, then the same can be said about any of its
nonzero multiples.
As part of our proofs, we identify a new property of multivariate polynomial
factorization. We show that under a random linear transformation ,
completely factors via power series roots. Moreover, the
factorization adapts well to circuit complexity analysis. This with allRootsNI
are the techniques that help us make progress towards the old open problems,
supplementing the large body of classical results and concepts in algebraic
circuit factorization (eg. Zassenhaus, J.NT 1969, Kaltofen, STOC 1985-7 \&
Burgisser, FOCS 2001).Comment: 33 Pages, No figure
Constrained quantization for the Cantor distribution
In this paper, we generalize the notion of unconstrained quantization of the
classical Cantor distribution to constrained quantization and give a general
definition of constrained quantization. Toward this, we calculate the optimal
sets of -points, th constrained quantization errors, the constrained
quantization dimensions, and the constrained quantization coefficients taking
different families of constraints for all . The results in this
paper show that both the constrained quantization dimension and the constrained
quantization coefficient for the Cantor distribution depend on the underlying
constraints. It also shows that the constrained quantization coefficient for
the Cantor distribution can exist and be equal to the constrained quantization
dimension. These facts are not true in the unconstrained quantization for the
Cantor distribution.Comment: arXiv admin note: text overlap with arXiv:2305.1111
Constrained quantization for the Cantor distribution with a family of constraints
In this paper, for a given family of constraints and the classical Cantor
distribution we determine the constrained optimal sets of -points, th
constrained quantization errors for all positive integers . We also
calculate the constrained quantization dimension and the constrained
quantization coefficient, and see that the constrained quantization dimension
exists as a finite positive number, but the -dimensional
constrained quantization coefficient does not exist
Constrained quantization for the Cantor distribution with a family of constraints
In this paper, for a given family of constraints and the classical Cantor distribution we determine the optimal sets of n-points, nth constrained quantization errors for all positive integers n. We also calculate the constrained quantization dimension and the constrained quantization coefficient, and see that the constrained quantization dimension D(P) exists as a finite positive number, but the D(P)-dimensional constrained quantization coefficient does not exist
Conditional constrained and unconstrained quantization for probability distributions
In this paper, we present the idea of conditional quantization for a Borel
probability measure on a normed space . We introduce the
concept of conditional quantization in both constrained and unconstrained
scenarios, along with defining the conditional quantization errors, dimensions,
and coefficients in each case. We then calculate these values for specific
probability distributions. Additionally, we demonstrate that for a Borel
probability measure, the lower and upper quantization dimensions and
coefficients do not depend on the conditional set of the conditional
quantization in both constrained and unconstrained quantization
Recommended from our members
Knowledge and Attitude Regarding Social Media as a Source of Information among Farmers of District Kota, Rajasthan
The present study was undertaken to assess the knowledge and attitude of farmers regarding social media in the Kota district of Rajasthan, during the year 2022-23. The study used purposive sampling to select one Block, namely Khairabad and simple random sampling to select four villages from the block. In total four villages were selected for the study, and a total sample of 120 social media users was chosen using proportionate simple random sampling technique. The study revealed that the maximum respondent was middle-aged (42.5%), while farmers (50.8%) had small land holdings. The maximum number of respondents having a medium level of economic motivation, and social media exposure, and about fifty-three percent (52.5%) of the respondents have medium level of knowledge about social media. The majority of the farmers (65.8%) have maximum knowledge about social media are very useful but sometimes it helps in spreading wrong information, while less than fifty percent (49.2%) the of farmer have a medium-level attitude regarding social media. Age, Occupation, Educational qualification, Farm power, and Economic motivation are positively and significantly correlated at 0.01% level of probability and Family size, Landholding, social media exposure is positively and Family size, Landholding, social media exposure is significantly at 0.05% level with the knowledge toward use of social media. On the other hand, all the independent variables were significantly and positively correlated with attitude level at 0.01% and 0.05%
Constrained quantization for probability distributions
In this paper, for a Borel probability measure P on a Euclidean space Rk, we extend the definitions of nth unconstrained quantization error, unconstrained quantization dimension, and unconstrained quantization coefficient, which traditionally in the literature known as nth quantization error, quantization dimension, and quantization coefficient, to the definitions of nth constrained quantization error, constrained quantization dimension, and constrained quantization coefficient. The work in this paper extends the theory of quantization and opens a new area of research. In unconstrained quantization, the elements in an optimal set are the conditional expectations in their own Voronoi regions, and it is not true in constrained quantization. In unconstrained quantization, if the support of P contains infinitely many elements, then an optimal set of n-means always contains exactly n elements, and it is not true in constrained quantization. It is known that the unconstrained quantization dimension for an absolutely continuous probability measure equals the Euclidean dimension of the underlying space. In this paper, we show that this fact is not true as well for the constrained quantization dimension. It is known that the unconstrained quantization coefficient for an absolutely continuous probability measure exists as a unique finite positive number. From work in this paper, it can be seen that the constrained quantization coefficient for an absolutely continuous probability measure can be any nonnegative number depending on the constraint that occurs in the definition of nth constrained quantization error
Conditional constrained and unconstrained quantization for probability distributions
In this paper, we present the idea of conditional quantization for a Borel probability measure P on a normed space Rk. We introduce the concept of conditional quantization in both constrained and unconstrained scenarios, along with defining the conditional quantization errors, dimensions, and coefficients in each case. We then calculate these values for specific probability distributions. Additionally, we demonstrate that for a Borel probability measure, the lower and upper quantization dimensions and coefficients do not depend on the conditional set of the conditional quantization in both constrained and unconstrained quantization
Constrained quantization for a uniform distribution with respect to a family of constraints
In this paper, with respect to a family of constraints for a uniform probability distribution we determine the optimal sets of n-points and the nth constrained quantization errors for all positive integers n. We also calculate the constrained quantization dimension and the constrained quantization coefficient. The work in this paper shows that the constrained quantization dimension of an absolutely continuous probability measure depends on the family of constraints and is not always equal to the Euclidean dimension of the underlying space where the support of the probability measure is defined
Conditional optimal sets and the quantization coefficients for some uniform distributions
Bucklew and Wise (1982) showed that the quantization dimension of an absolutely continuous probability measure on a given Euclidean space is constant and equals the Euclidean dimension of the space, and the quantization coefficient exists as a finite positive number. By giving different examples, in this paper, we have shown that the quantization coefficients for absolutely continuous probability measures defined on the same Euclidean space can be different. We have taken uniform distribution as a prototype of an absolutely continuous probability measure. In addition, we have also calculated the conditional optimal sets of n-points and the nth conditional quantization errors for the uniform distributions in constrained and unconstrained scenarios
- …
