Results 21 to 30 of about 2,087,732 (267)
$\alpha$-Differentiable functions in complex plane
Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki, 2020 In this paper, the conformable fractional derivative of order $\alpha$ is defined in complex plane. Regarding to multi-valued function $z^{1-\alpha}$, we obtain fractional Cauchy–Riemann equations which in case of $\alpha=1$ give classical Cauchy ...
Ronak Pashaei +3 more
doaj +1 more source
On the Complexity of Classification Functions [PDF]
38th International Symposium on Multiple Valued Logic (ismvl 2008), 2008 A classification function is a multiple-valued input function specified by a set of rules, where each rule is a conjunction of range functions. The function is useful for packet classification for internet, network intrusion detection system, etc. This paper considers the complexity of range functions and classification functions represented by sum-of ...
openaire +2 more sources
On Complex Gamma-Function Integrals [PDF]
Symmetry, Integrability and Geometry: Methods and Applications, 2020 It was observed recently that relations between matrix elements of certain operators in the ${\rm SL}(2,\mathbb R)$ spin chain models take the form of multidimensional integrals derived by R.A. Gustafson. The spin magnets with ${\rm SL}(2,\mathbb C)$ symmetry group and ${\rm L}_2(\mathbb C)$ as a local Hilbert space give rise to a new type of $Γ ...
Derkachov, Sergey É. +1 more
openaire +5 more sources
The analyticity of double complex variables functions
上海师范大学学报. 自然科学版, 2023 Due to the complexity of complex functions， many textbooks focus on the nature of univariate variable complex functions， but just simply mention multi-complex variables functions.
GENG Yongcai, CHEN Ling
doaj +1 more source
Intermediate rings of complex-valued continuous functions
Applied General Topology, 2021 For a completely regular Hausdorff topological space X, let C(X, C) be the ring of complex-valued continuous functions on X, let C ∗ (X, C) be its subring of bounded functions, and let Σ(X, C) denote the collection of all the rings that lie between C ...
Amrita Acharyya +3 more
doaj +1 more source
On the Complexity of Real Functions [PDF]
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 2005 We develop a notion of computability and complexity of functions over the reals, which seems to be very natural when one tries to determine just how "difficult" a certain function is. This notion can be viewed as an extension of both BSS computability [Blum, Cucker, Shub, Smale 1998], and bit computability in the tradition of computable analysis ...
openaire +4 more sources
COMPLEXITY OF SHORT GENERATING FUNCTIONS [PDF]
Forum of Mathematics, Sigma, 2018 We give complexity analysis for the class ofshort generating functions. Assuming#P$\not \subseteq$FP/poly, we show that this class is not closed under taking many intersections, unions or projections of generating functions, in the sense that these operations can increase the bit length of coefficients of generating functions by a super-polynomial ...
DANNY NGUYEN, IGOR PAK
openaire +4 more sources
Two-periodic problem of loading an isotropic plane with a hexagonal packing of elliptical inclusions
Вестник Самарского университета: Естественнонаучная серияThis paper presents a solution to the plane doubly periodic problem of loading an infinite, isotropic, elastic plane with a hexagonal packing of elliptical inclusions. The plane is subjected to one of three types of remote loading: uniaxial tension along
I. F. Startsev, L. Yu. Startseva
doaj +1 more source
CoRR, 2021 Functions correspond to one of the key concepts in mathematics and science, allowing the representation and modeling of several types of signals and systems. The present work develops an approach for characterizing the coverage and interrelationship between discrete signals that can be fitted by a set of reference functions, allowing the definition of ...
openaire +2 more sources
Complexity of inverting the Euler function [PDF]
Mathematics of Computation, 2006 Given an integer n n , how hard is it to find the set of all integers
Scott Contini +2 more
openaire +3 more sources