Related papers: Composition with a two variable function
In this paper we deal with composite rational functions having zeros and poles forming consecutive elements of an arithmetic progression. We also correct a result published earlier related to composite rational functions having a fixed…
It is proved that harmonic functions are characterized by harmonicity of their spherical means, for which purpose the iterated spherical means are used. The similar characterization of solutions to the modified Helmholtz equation…
Polymorphic circuits are a special kind of circuits which possess multiple build-in functions, and these functions are activated by environment parameters, like temperature, light and VDD. The behavior of a polymorphic circuit can be…
Determining the approximate degree composition for Boolean functions remains a significant unsolved problem in Boolean function complexity. In recent decades, researchers have concentrated on proving that approximate degree composes for…
A composite likelihood is an inference function derived by multiplying a set of likelihood components. This approach provides a flexible framework for drawing inference when the likelihood function of a statistical model is computationally…
This is a compendium of generating functions involving single, double sums and definite integrals. These generating functions also involve special functions in both the summand function and closed form solution.
The variant of calculation of functions of set and their application is offered. In particular: the new measure of system of sets generalizing classical concept of a measure is entered; the variation of set that has allowed to construct a…
Open dynamical systems are mathematical models of machines that take input, change their internal state, and produce output. For example, one may model anything from neurons to robots in this way. Several open dynamical systems can be…
We study which standard operators of probabilistic process calculi allow for compositional reasoning with respect to bisimulation metric semantics. We argue that uniform continuity (generalizing the earlier proposed property of…
This paper introduces and studies the sequential composition and decomposition of propositional logic programs. We show that acyclic programs can be decomposed into single-rule programs and provide a general decomposition result for…
We study functional graphs generated by quadratic polynomials over prime fields. We introduce efficient algorithms for methodical computations and provide the values of various direct and cumulative statistical parameters of interest. These…
This dissertation builds a compositional cyber-physical systems theory to develop concrete semantics relating the above diverse views necessary for safety and security assurance. In this sense, composition can take two forms. The first is…
We prove a closed formula for the derivative, of any order, of a implicit function, in terms of some binomial building blocks, and explain the combinatorics behind the coefficients appearing in the formula.
The Hermitian, complex and fermionic two-matrix models with infinite set of variables are constructed. We show that these two-matrix models can be realized by the $W$-representations. In terms of the $W$-representations, we derive the…
We consider a multiple arithmetical sum involving the Moebius function which despite its elementary appearance is in fact of a highly intriguing nature. We establish an asymptotic formula for the quadruple case that raises the first…
We introduce the notion of multi-pattern, a combinatorial abstraction of polyphonic musical phrases. The interest of this approach lies in the fact that this offers a way to compose two multi-patterns in order to produce a longer one. This…
A recipe is presented for constructing band-limited superoscillating functions that exhibit arbitrarily high frequencies over arbitrarily long intervals.
We use the theory of motivic integration in order to give a geometric explanation of the behavior of some p-adic integrals.
We give two characterizations of crooked functions: one based on the minimum distance of a Preparata-like code, and the other based on the distance-regularity of a crooked graph.
In this article we explore under which conditions on the interior function the composition of functions is measurable. We also study the sharpness of the result by providing a counterexample for weaker hypotheses.