相关论文: A DNC function that computes no effectively bi-imm…
We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that…
It is shown that harmonic functions from a simply connected domain in R^3 to R^3 cannot always be expressed as a sum of a monogenic (hyperholomorphic) function and an antimonogenic function, in contrast to the situation for complex numbers…
This paper analyses Escard\'o and Oliva's generalisation of selection functions over a strong monad from a game-theoretic perspective. We focus on the case of the nondeterminism (finite nonempty powerset) monad $\mathcal{P}$. We use these…
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
We show that the monodromy theorem holds on arbitrary connected free sets for noncommutative free analytic functions. Applications are numerous-- pluriharmonic free functions have globally defined pluriharmonic conjugates, locally…
Larsen and Skou characterized probabilistic bisimilarity over reactive probabilistic systems with a logic including true, negation, conjunction, and a diamond modality decorated with a probabilistic lower bound. Later on, Desharnais,…
We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of…
We study the model of continuous chemical reaction networks (CRNs), consisting of reactions such as $A+B \to C+D$ that can transform some continuous, nonnegative real-valued quantity (called a *concentration*) of chemical species $A$ and…
In this paper we construct an entire function of two variables having the property that its values and its partial derivatives of any order at any distinct algebraic points are algebraically independent. Such an entire function is generated…
Two transforms of functions on a half-line are considered. It is proved that their composition gives a concave majorant for every nonnegative function. In particular, this composition is the identity transform on the class of nonnegative…
We present a versatile construction allowing one to obtain pairs of integer sets with infinite symmetric difference, infinite intersection, and identical representation functions.
We investigate semiconjugate rational functions, that is rational functions $A,$ $B$ related by the functional equation $A\circ X=X\circ B$, where $X$ is a rational function of degree at least two. We show that if $A$ and $B$ is a pair of…
Benyamini and Lindenstrauss mention in their monograph \emph{Geometric nonlinear functional analysis Vol. 1., American Mathematical Society Colloquium Publications, 48. American Mathematical Society, Providence, RI, 2000} that there is no…
A method is presented for computing minimal answers in disjunctive deductive databases under the disjunctive stable model semantics. Such answers are constructed by repeatedly extending partial answers. Our method is complete (in that every…
Higher genus partition functions of two-dimensional conformal field theories have to be invariants under linear actions of mapping class groups. We illustrate recent results [4,6] on the construction of such invariants by concrete…
No-Cloning and No-Deleting theorems are verified with the constraint on local state transformations via the existence of incomparable states. Assuming the existence of exact cloning or deleting operation defined on a minimum number of two…
We show that some natural output conventions for error-free computation in chemical reaction networks (CRN) lead to a common level of computational expressivity. Our main results are that the standard consensus-based output convention have…
We investigate the problem whether a function of several arguments can be reconstructed from its identification minors. We focus on functions with a unique identification minor, and we establish some positive and negative results on the…
The definition of the binomial coefficient in terms of gamma functions also allows non-integer arguments. For nonnegative integer arguments the gamma functions reduce to factorials, leading to the well-known Pascal triangle. Using a…
We introduce the notion of Dunkl positive definite and strictly positive definite functions on $\mathbb{R}^{d}$. This done by the use of the properties of Dunkl translation. We establish the analogue of Bochner's theorem in Dunkl setting.…