Related papers: Prime Factoring and The Complexity Of
The article attempts to find an algebraic formula describing the correlation coefficients between random variables and the principal components representing them. As a result of the analysis, starting from selected statistics relating to…
This paper discusses why P and NP are likely to be different. It analyses the essence of the concepts and points out that P and NP might be diverse by sheer definition. It also speculates that P and NP may be unequal due to natural laws.
We investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation (PLDE). Two kinds of polynomials are to be distinguished, we call them /periodic/ and…
We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…
We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…
We state some elementary problems concerning the relation between difference calculus and differential calculus, and we try to convince the reader that, in spite of the simplicity of the statements, a solution of these problems would be a…
For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…
We initiate a study of algorithms with a focus on the computational complexity of individual elements, and introduce the fragile complexity of comparison-based algorithms as the maximal number of comparisons any individual element takes…
A system of commutative hyperbolic complex numbers in 2 dimensions is studied in this paper. Exponential and trigonometric forms are obtained for these hyperbolic twocomplex numbers. Expressions are given for the elementary functions of…
Using full images of accessible functors, we prove some results about combinatorial and accessible model categories. In particular, we give an example of a weak factorization system on a locally presentable category which is not accessible.
We derive some simple relations that demonstrate how the posterior convergence rate is related to two driving factors: a "penalized divergence" of the prior, which measures the ability of the prior distribution to propose a nonnegligible…
Let $R$ be a ring and $P$ a prime ideal of $R.$ In this paper, we establish some commutativity criteria for the factor ring $R/P$ in terms of derivations of $R$ satisfying some algebraic identities involving a new kind of involution in…
The purpose of this article is threefold. First, it provides the reader with a few useful and efficient tools which should enable her/him to evaluate nontrivial determinants for the case such a determinant should appear in her/his research.…
We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…
In a real expert system, one may have unreliable, unconfident, conflicting estimates of the value for a particular parameter. It is important for decision making that the information present in this aggregate somehow find its way into use.…
We briefly review the calculational procedure for the PQCD prediction for hard exclusive quantities and reconsider the problem of the factorization scale dependence.
We estimate from below the lower density of the set of prime numbers p such that p-1 has a prime factor of size at least p^c, where c lies in between 1/4 and 1/2. We also establish upper and lower bounds on the counting function of the set…
This study presents the approach to analyzing the evolution of an arbitrary complex system whose behavior is characterized by a set of different time-dependent factors. The key requirement for these factors is only that they must contain an…
A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…
We survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory. Our primary focus is on recent findings concerning the (un)provability of complexity…