Related papers: Partial functions and domination
Applying techniques originally developed for systems lacking a variational structure, we establish conditions for the existence of solutions in systems that possess this property but their energy functional is unbounded both lower and…
In this note we axiomatize the classes of rudimentary functions, primitive recursive functions, safe recursive set functions, and predicatively computable functions.
For every partial combinatory algebra (pca) $A$ and every partial endofunction on $A$, a pca $A[f]$ is constructed such that in $A[f]$, the function $f$ is representable by an element; a universal property of the construction is formulated…
The following representation theorem is proven: A partially ordered commutative ring $R$ is a subring of a ring of almost everywhere defined continuous real-valued functions on a compact Hausdorff space $X$ if and only if $R$ is archimedean…
Fractional analysis is applied to describe classical dynamical systems. Fractional derivative can be defined as a fractional power of derivative. The infinitesimal generators {H, .} and L=G(q,p) \partial_q+F(q,p) \partial_p, which are used…
We discuss the possibility of constructing a function that validates the definition or not definition of the partial recursive functions of one variable. This is a topic in computability theory, which was first approached by Alan M. Turing…
We consider a class of functions defined on metric spaces which generalizes the concept of piecewise Lipschitz continuous functions on an interval or on polyhedral structures. The study of such functions requires the investigation of their…
In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…
We define and prove existence of fractional $P(\phi)_1$-processes as random processes generated by fractional Schr\"odinger semigroups with Kato-decomposable potentials. Also, we show that the measure of such a process is a Gibbs measure…
A `whole-part' theory is developed for a set of finite quantum systems $\Sigma (n)$ with variables in ${\mathbb Z}(n)$. The partial order `subsystem' is defined, by embedding various attributes of the system $\Sigma (m)$ (quantum states,…
This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…
We study the local Lipschitz one subsets of a finite dimensional space, that is, sets for which there exists a continuous function whose local Lipschitz derivative is the characteristic function of said set. We give a characterization of a…
We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…
This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for…
Poincar\'e recurrence theorem implies the density of recurrent points for volume-preserving dynamical systems on compact domains. The density of closed orbits in the non-wandering set is one of the essential properties of Axiom A and chaos.…
We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…
A poset P is called reversible if every order preserving bijective self map of P is an order automorphism. P is called hereditarily reversible if every subposet of P is reversible. We give a complete characterization of hereditarily…
We provide an explicit characterization of the properties of primitive recursive functions that are decidable or semi-decidable, given a primitive recursive index for the function. The result is much more general as it applies to any c.e.…
We consider manipulation problems when the manipulator only has partial information about the votes of the nonmanipulators. Such partial information is described by an information set, which is the set of profiles of the nonmanipulators…
We explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a function of incomplete degree that dominates almost all degrees. This…