Related papers: Prime Factoring and The Complexity Of
Factor analysis provides linear factors that describe relationships between individual variables of a data set. We extend this classical formulation into linear factors that describe relationships between groups of variables, where each…
Many apparently contradictory approaches to TMD factorization and its non-perturbative content exist. This talk evaluated the different methods and proposed tools for resolving the contradictions and experimentally adjudicating the results.
We use the periodicity properties of generalized Gauss sums to factor numbers. Moreover, we derive rules for finding the factors and illustrate this factorization scheme for various examples. This algorithm relies solely on interference and…
We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several…
The classical decision problem, as it is understood today, is the quest for a delineation between the decidable and the undecidable parts of first-order logic based on elegant syntactic criteria. In this paper, we treat the concept of…
We review some recent results on properties of tensor product and fusion coefficients under complex conjugation of one of the factors. Some of these results have been proven, some others are conjectures awaiting a proof, one of them…
This paper presents a plausible reasoning system to illustrate some broad issues in knowledge representation: dualities between different reasoning forms, the difficulty of unifying complementary reasoning styles, and the approximate nature…
Methods are described for the nonperturbative calculation of wave functions and scattering amplitudes in light-cone quantization. Form factors are computed from the boost-invariant wave functions, which appear as coefficients in a…
The compositeness $X$ is defined as the probability to observe the composite structure such as the hadronic molecule component in a bound state. One of the model-independent approaches to calculate $X$ is the weak-binding relation. However,…
A composite likelihood is a non-genuine likelihood function that allows to make inference on limited aspects of a model, such as marginal or conditional distributions. Composite likelihoods are not proper likelihoods and need therefore…
We use a combinatorial approach to compute the number of non-isomorphic choices on four elements that can be explained by models of bounded rationality.
In this paper we investigate the complexity of abduction, a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining the world's behavior it aims at finding an explanation for some observed manifestation.…
We examine an elementary problem on prime divisibility of binomial coefficients. Our problem is motivated by several related questions on alternating groups.
Prime factorization is an outstanding problem in arithmetic, with important consequences in a variety of fields, most notably cryptography. Here we employ the intriguing analogy between prime factorization and optical interferometry in…
Different q-factor definitions are considered. The formula connecting different q-factors is given. Also it is pointed the way to find all the q-factors from experimental data.
We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…
We consider the possibility problem of determining if a document is a possible world of a probabilistic document, in the setting of probabilistic XML. This basic question is a special case of query answering or tree automata evaluation, but…
Although the characterization of ring derivations has an extensive literature, up to now, all of the characterizations have had the following form: additivity and another property imply that the function in question is a derivation. The aim…
With the increasing deployment of machine learning systems in practice, transparency and explainability have become serious issues. Contrastive explanations are considered to be useful and intuitive, in particular when it comes to…
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…