Related papers: Frobenius Pseudoprimes
We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi's theorem, which asserts that any subset of the integers of positive density contains progressions of…
We introduce a class of potential submanifolds in pseudo-Euclidean spaces (each N-dimensional potential submanifold is a special flat torsionless submanifold in a 2N-dimensional pseudo-Euclidean space) and prove that each N-dimensional…
All of the experiments supporting Einstein's Special Relativity Theory are also supportive of the Lorentz ether theory, or many other ether theories. However, a growing number of experiments show deviations from Einstein's Special…
The main subject of this paper is the study of analytic second order linear partial differential equations. We aim to solve the classical equations and some more, in the real or complex analytical case. This is done by introducing methods…
Multiple testing problems are a staple of modern statistical analysis. The fundamental objective of multiple testing procedures is to reject as many false null hypotheses as possible (that is, maximize some notion of power), subject to…
This paper introduces pragmatic hypotheses and relates this concept to the spiral of scientific evolution. Previous works determined a characterization of logically consistent statistical hypothesis tests and showed that the modal operators…
We prove a duality principle for a special class of submanifolds in pseudo-Euclidean spaces. This class of submanifolds with potential of normals is introduced in this paper. We prove also, for example, that an arbitrary Frobenius manifold…
We extend the theoretical framework of proof mining by establishing general logical metatheorems that allow for the extraction of the computational content of theorems with prima facie "non-computational" proofs from probability theory,…
In order to study graded Frobenius algebras from a ring theoretical perspective, we introduce graded quasi-Frobenius rings, graded Frobenius rings and a shift-version of the latter ones, and we investigate the structure and representations…
Recently the mathematical formalism of quantum mechanics, especially methods of quantum probability theory, started to be widely used in a variety of applications outside of physics, e.g., cognition and psychology as well as economy and…
Test ideals were first introduced by Mel Hochster and Craig Huneke in their celebrated theory of tight closure, and since their invention have been closely tied to the theory of Frobenius splittings. Subsequently, test ideals have also…
Hippocratic randomness is defined in a similar way to Martin-Lof randomness, however it does not assume computability of the probability and the existence of universal test is not assured. We introduce the notion of approximation of…
Ultrafunctions are a particular class of functions defined on a Non Archimedean field E. They have been introduced and studied in some previous works. In this paper we develop the notion of fine ultrafunctions which improves the older…
This paper presents an advance in the direction of working with probabilities in a paracomplete setting using Logics of Formal Undeterminedness (LFUs). The undeterminedness is interpreted here as missing evidence. A theorem of total…
Proofs (sequent calculus, natural deduction) and imperative algorithms (pseudocodes) are two well-known coexisting concepts. Then what is their relationship? Our answer is that \[ imperative\ algorithms\ =\ proofs\ with\ cuts \] This…
Fine-tuning in physics and cosmology is often used as evidence that a theory is incomplete. For example, the parameters of the standard model of particle physics are "unnaturally" small (in various technical senses), which has driven much…
This is a survey on propositional proof complexity aimed at introducing the basics of the field with a particular focus on a method known as feasible interpolation. This method is used to construct "hard theorems" for several proof systems…
In this contribution, we augment the metric learning setting by introducing a parametric pseudo-distance, trained jointly with the encoder. Several interpretations are thus drawn for the learned distance-like model's output. We first show…
We describe the average sizes of the set of bad witnesses for a pseudo-primality test which is the product of a multiple-rounds Miller-Rabin test by the Galois test.
We generalise the randomness test definitions in the literature for both the Martin-L\"of and Schnorr randomness of a series of binary outcomes, in order to allow for interval-valued rather than merely precise forecasts for these outcomes,…