Related papers: Parry condition, existence and uniqueness of alter…

We prove some theorems which give sufficient conditions for the existence of prime numbers among the terms of a sequence which has pairwise relatively prime terms.

We establish a necessary condition for pseudoprimality and a sufficient condition for primality of Fermat numbers, based on a congruence involving the exponent $(F_n-1)/4$. Moreover, in connection with P\'epin's primality test, we obtain a…

This is a short survey on the connection between general extension theories and the study of realizations of elliptic operators A on smooth domains in R^n, n > 1. The theory of pseudodifferential boundary problems has turned out to be very…

Neglecting many motivating details for the Park-Pham theorem (previously known as the Kahn-Kalai conjecture), the result starts with a finite set $X$, a non-trivial upper set $\mathcal{F} \subseteq 2^X$, and a particular parameterized…

We present a simple new method for proving that languages are not regular. We prove the correctness of the method, illustrate the ease of using the method on well-known examples of nonregular languages, and prove two additional theorems on…

This paper will develop a single framework for unifying, simplifying and extending our prior results about axiom systems that retain a partial knowledge of their own consistency, via an axiomatic declaration of self-consistency. Its perhaps…

Some classic second-order sufficient optimality conditions in the calculus of variations are shown to be equivalent, while also introducing a new equivalent second-order condition which is extremely easy to apply: simply integrate a linear…

In this paper, first some results of [5] are extended for subadditive separating maps between C(X;E) and C(Y;E), such that E is a unital Banach algebra. Then we give some conditions under which a strongly subadditive map has a unique fixed…

This paper introduces and studies a new model of computation called an Alternating Automatic Register Machine (AARM). An AARM possesses the basic features of a conventional register machine and an alternating Turing machine, but can carry…

We present a maximal class of analytic functions, elements of which are in one-to-one correspondence with their asymptotic expansions. In recent decades it has been realized (B. Malgrange, J. Ecalle, J.-P. Ramis, Y. Sibuya et al.), that the…

In quantum logical terms, Hardy-type arguments can be uniformly presented and extended as collections of intertwined contexts and their observables. If interpreted classically those structures serve as graph-theoretic "gadgets" that enforce…

In this work, a functional variant of the polynomial analogue of the classical Gandy's fixed point theorem is obtained. Sufficient conditions have been found to ensure that the complexity of the recursive function does not go beyond the…

A word $w$ is called rich if it contains $| w|+1$ palindromic factors, including the empty word. We say that a rich word $w$ can be extended in at least two ways if there are two distinct letters $x,y$ such that $wx,wy$ are rich. Let $R$…

We derive a Mal'cev condition for congruence meet-semidistributivity and then use it to prove two theorems. Theorem A: if a variety in a finite language is congruence meet-semidistributive and residually less than some finite cardinal, then…

Let $r$ and $s$ be multiplicatively independent positive integers. We establish that the $r$-ary expansion and the $s$-ary expansion of an irrational real number, viewed as infinite words on $\{0, 1, \ldots , r-1\}$ and $\{0, 1, \ldots ,…

There are several extensions of the classical Banach Fixed Point Theorem in technical literature. A branch of generalizations replaces usual contractivity by weaker but still effective assumptions. Our note follows this stream, presenting…

It is often claimed that Bayesian methods, in particular Bayes factor methods for hypothesis testing, can deal with optional stopping. We first give an overview, using elementary probability theory, of three different mathematical meanings…

Neutrices are additive subgroups of a nonstandard model of the real numbers. An external number is the algebraic sum of a nonstandard real number and a neutrix. Due to the stability by some shifts, external numbers may be seen as…

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

Uniqueness quantification ($\exists !$) is a quantifier in first-order logic where one requires that exactly one element exists satisfying a given property. In this paper we investigate the strength of uniqueness quantification when it is…