Related papers: Potential theory and a characterization of polynom…
We introduce the basic concepts related to subharmonic functions and potentials, mainly for the case of the complex plane and prove the Riesz decomposition theorem. Beyond the elementary facts of the theory we deviate slightly from the…
We find that the solution of the polar angular differential equation can be written as the universal associated Legendre polynomials. Its generating function is applied to obtain an analytical result for a class of interesting integrals…
We study how the field of definition of a rational function changes under iteration. We provide a complete classification of polynomials with the property that the field of definition of one of their iterates drops in degree (over a given…
The paper deals with a comprehensive theory of mappings, whose local behavior can be described by means of linear subspaces, contained in the graphs of two (primal and dual) generalized derivatives. This class of mappings includes the…
Classical probability theory is formulated using sets. In this paper, we extend classical probability theory with propositional computability logic. Unlike other formalisms, computability logic is built on the notion of events/games, which…
Motion polynomials (polynomials over the dual quaternions with nonzero real norm) describe rational motions. We present a necessary and sufficient condition for reduced bounded motion polynomials to admit factorizations into monic linear…
We provide detailed local descriptions of stable polynomials in terms of their homogeneous decompositions, Puiseux expansions, and transfer function realizations. We use this theory to first prove that bounded rational functions on the…
In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…
We study the class of polynomials that map a local field (i.e., the completion of a number field at a non-Archimedean place) into the subset of its $p$-th powers, where $p$ is the residue characteristic of the field in question. We present…
I investigate the modal commitments of various conceptions of the philosophy of arithmetic potentialism. Specifically, I shall consider the potentialist conceptions arising from a model-theoretic view of the models of arithmetic as possible…
The Kolmogorov axioms for probability functions are placed in the context of signed meadows. A completeness theorem is stated and proven for the resulting equational theory of probability calculus. Elementary definitions of probability…
In this paper, we introduce a semantics of realisability for the classical propositional natural deduction and we prove a correctness theorem. This allows to characterize the operational behaviour of some typed terms.
Within classical propositional logic, assigning probabilities to formulas is shown to be equivalent to assigning probabilities to valuations. A novel notion of probabilistic entailment enjoying desirable properties of logical consequence is…
Based on the probability distribution observed in complex systems and an assumption that the probability distributions of complex systems satisfy a new generalized multiplication, it is proved that the statistical theory of complex systems…
We propose analogs of the classical Generalized Riemann Hypothesis and the Generalized Simplicity Conjecture for the characteristic p L-series associated to function fields over a finite field. These analogs are based on the use of absolute…
We study polynomials with no zeros on the unit ball in complex Euclidean space with a view toward characterizing when a rational function is bounded on the ball. We give a complete local description of such polynomials in two variables near…
This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…
The problem to decide whether a given rational function in several variables is positive, in the sense that all its Taylor coefficients are positive, goes back to Szeg\H{o} as well as Askey and Gasper, who inspired more recent work. It is…
In this paper we consider polynomial representability of functions defined over $Z_{p^n}$, where $p$ is a prime and $n$ is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to…
The main purpose of this work is to prove characterization theorems for generalized moment functions on groups. According one of the main results these are exponential polynomials that can be described with the aid of complete (exponential)…