Search

A generalized Stirling numbers of the second kind \begin{document}$ S_{a,b}\left(p,k\right) $\end{document} , involved in the expansion \begin{document}$ \left(an+b\right)^{p} = \sum_{k = 0}^{p}k!S_{a,b}\left(p,k\right) \binom{n}{k} $\end{document} , where \begin{document}$ a \neq 0, b $\end{document} are complex numbers, have studied in [ 16 ]. In this paper, we show that Bernoulli polynomials \begin{document}$ B_{p}(x) $\end{document} can be written in terms of the numbers \begin{document}$ S_{1,x}\left(p,k\right) $\end{document} , and then use the known results for \begin{document}$ S_{1,x}\left(p,k\right) $\end{document} to obtain several new explicit formulas, recurrences and generalized recurrences for Bernoulli numbers and polynomials.

Purpose This study aims to propose the parametric-guiding algorithm, the complex-root (CR) tunneling algorithm and the method that integrates both algorithms for the heat and fluid flow (HFF) community, and apply them to nonlinear Bratu’s boundary-value problem (BVP) and Blasius BVP. Design/methodology/approach In the first algorithm, iterations are primarily guided by a diminishing parameter that is introduced to reduce magnitudes of fictitious source terms. In the second algorithm, when iteration-related barriers are encountered, CRs are generated to tunnel through the barrier. At the exit of the tunnel, imaginary parts of CRs are trimmed. Findings In terms of the robustness of convergence, the proposed method outperforms the traditional Newton–Raphson (NR) method. For most pulsed initial guesses that resemble pulsed initial conditions for the transient Bratu BVP, the proposed method has not failed to converge. Originality/value To the best of the authors’ knowledge, the parametric-guiding algorithm, the CR tunneling algorithm and the method that integrates both have not been reported in the computational-HFF-related literature.

Let A and B be two closed linear relations acting between two Banach spaces X and Y , and let λ be a complex number. We study the stability of the nullity and deficiency of A when it is perturbed by λ B . In particular, we show the existence of a constant ρ > 0 for which both the nullity and deficiency of A remain stable under perturbation by λ B for all λ inside the disk λ < ρ .

In this work the authors derive the Stieltjes transform of the logarithmic function in terms of the Lerch function. This transform is used to derive closed form solutions involving fundamental constants and special functions. Specifically we derive the definite integral given by\[\int_{0}^{\infty} \frac{(1-b x)^m \log ^k(c (1-b x))+(b x+1)^m \log ^k(c (b x+1))}{a+x^2}dx\]where $a,b,c,m$ and $k$ are general complex numbers subject to the restrictions given in connection with the formulas.

In this study, the planar kinematics has been studied in a generalized complex plane which is a geometric representation of the generalized complex number system. Firstly, the planar kinematic formulas with one parameter for homothetic motions in the generalized complex plane have been mentioned briefly. Then, the Steiner area formula given areas of the trajectories drawn by the points taken in a generalized complex plane have been obtained during the one-parameter planar homothetic motion. Finally, the Holditch theorem, which gives the relationship between these areas of trajectories, has been expressed for homothetic motions in a generalized complex plane. So, this theorem obtained in this study is the most general form of all Holditch theorems obtained so far.

In this paper, without dividing complex-variable networks into two subsystems with real values, the finite-time synchronization is considered for complex-valued dynamical networks with fractional order by means of the theory of complex-variable functions. First of all, as a generalization of the real-valued sign function, the sign functions of complex-valued numbers and complex-valued vectors are introduced and some formulas about them are established. Under the sign function framework, two complex-valued control strategies are designed based on two different norms of complex numbers. Some synchronization criteria are derived and the settling times of synchronization are effectively estimated by developing fractional-order finite-time differential inequalities and utilizing the theory of complex-variable functions. The established theoretical results are demonstrated and the effect of the fractional order of the network model on the finite-time synchronization is revealed finally by providing some numerical simulations.

Shallow water equations are widely used in the simulation of those geophysical flows for which the flow horizontal length scale is much greater than the vertical one. Inspired by the example of lava flows, we consider here a modified model with an additional transport equation for a scalar quantity (e.g., temperature), and the derivation of the shallow water equations from depth-averaging the Navier-Stokes equations is presented. The assumption of constant vertical profiles for some of the model variables is relaxed allowing the presence of vertical profiles, and it follows that the non-linearity of the flux terms results in the introduction of appropriate shape coefficients. The space discretization of the resulting system of hyperbolic partial differential equations is obtained with a modified version of the finite volume central-upwind scheme introduced by Kurganov and Petrova in 2007. The time discretization is based on an implicit-explicit Runge-Kutta method which couples properly the hyperbolic part and the stiff source terms, avoiding the use of a very small time step; the use of complex arithmetic increases accuracy in the implicit treatment of stiff terms. The whole scheme is proved to preserve the positivity of flow thickness and the stationary steady-states. Some numerical experiments are performed to validate the proposed method and to show the incidence on the numerical solutions of shape coefficients introduced in the model.

Complex fans are sets of complex numbers whose magnitudes and angles range in closed intervals. The fact that the sum of two fans is a disordered shape gives rise to the need for computational methods to find the minimal enclosing fan. Cases where the sum of two fans contains the origin of the complex plane as a boundary point are of special interest. The result of the addition is then enclosed by circles in current methods, but under certain circumstances this turns out to be an overestimate. The focus of this article is the diagnosis and treatment of such cases.

This article proposes the Mamdani complex fuzzy inference system (Mamdani CFIS) to improve performance of the classical FIS and complex FIS. The applicability of the proposed CFIS is demonstrated by applying it to six commonly available datasets from UCI Machine Learning under the comparison with Mamdani FIS and the Adaptive Neuro Complex Fuzzy Inference System (ANCFIS). It is successfully proven that the proposed Mamdani CFIS is computationally less expensive and presents a more efficient method to handle time-series data and time-periodic phenomena, among all the fuzzy IS found thus far in the literature. Furthermore, the novelty of CFIS mainly lies in its implementation of the complex number throughout the entire procedures of computation. This gives much greater flexibility of implementing unexpected, nonlinear fluctuations.

Recently, some uniqueness theorems about meromorphic functions f(z) concerning their derivatives $$f'(z)$$ and shifts $$f(z+c)$$ with three CM sharing values have been obtained. In this paper, we continue to study this topic. We consider not only high order derivatives instead of just $$f'(z)$$ , but also IM sharing value instead of CM sharing value. In fact, we mainly prove that for a non-constant meromorphic function f(z) of hyper order strictly less than 1, if $$f^{(k)}(z)$$ and $$f(z+c)$$ share $$0,\infty $$ CM and 1 IM, then $$f^{(k)}(z)\equiv f(z+c)$$ , where c is a non-zero finite complex number. Our main theorem generalizes and greatly improves the related result due to Qi–Li–Yang. In addition, we give some discussion of this issue and obtain a uniqueness theorem concerning defective values in Sect. 3.

This paper proposes a unified depth model based on the light field gradient, in which estimated disparity is represented by the complex number. The complex-valued disparity by the proposed depth model can be represented in both the Cartesian and polar coordinates. In the Cartesian representation, the proposed depth model is represented by real and imaginary parts of the disparity. The real part can be used for disparity estimation with respect to the in-focus plane, whereas the imaginary part represents the non-Lambertian-ness. In the polar representation, the proposed depth model is expressed by the disparity magnitude and disparity angle. The disparity magnitude shows the relationship among depth from stereo, depth from focus, and depth from defocus, whereas the disparity angle shows whether or not the bundles of rays are flipped with respect to the in-focus plane. For disparity analysis, we present the real response, imaginary response, magnitude response, and angle response, which are represented by the three-dimensional volume. Experimental results on synthetic and real light field images show that the real and magnitude responses of the proposed depth model are valid for local disparity estimation.

Let p n : C → C p_n:\mathbb {C} \rightarrow \mathbb {C} be a random complex polynomial whose roots are sampled i.i.d. from a radial distribution 2 π r u ( r ) d r 2\pi r u(r) dr in the complex plane. A natural question is how the distribution of roots evolves under repeated (say n / 2 − n/2- times) differentiation of the polynomial. We conjecture a mean-field expansion for the evolution of ψ ( s ) = u ( s ) s \psi (s) = u(s) s : ∂ ψ ∂ t = ∂ ∂ x ( ( 1 x ∫ 0 x ψ ( s ) d s ) − 1 ψ ( x ) ) . \begin{equation*} \frac {\partial \psi }{\partial t} = \frac {\partial }{\partial x} \left ( \left ( \frac {1}{x} \int _{0}^{x} \psi (s) ds \right )^{-1} \psi (x) \right ). \end{equation*} The evolution of ψ ( s ) ≡ 1 \psi (s) \equiv 1 corresponds to the evolution of random Taylor polynomials p n ( z ) = ∑ k = 0 n γ k z k k ! where γ k ∼ N C ( 0 , 1 ) . \begin{equation*} p_n(z) = \sum _{k=0}^{n}{ \gamma _k \frac {z^k}{k!}} \quad \text {where} \quad \gamma _k \sim \mathcal {N}_{\mathbb {C}}(0,1). \end{equation*} We discuss some numerical examples suggesting that this particular solution may be stable. We prove that the solution is linearly stable. The linear stability analysis reduces to the classical Hardy integral inequality. Many open problems are discussed.

Let [Formula: see text] be a complex number, and a class of non-semisimple and non-solvable rank two Lie conformal algebras [Formula: see text] are introduced. In this paper, conformal derivations, conformal quasiderivations, generalized conformal derivations and conformal biderivations of [Formula: see text] are studied. Besides, central extensions and conformal modules of rank one of [Formula: see text] are determined.

Complex uncertain variables are measurable functions from an uncertainty space to the set of complex numbers and are used to model complex uncertain quantities. This paper introduces the convergence concepts of convergence almost surely (a.s.), convergence in measure, convergence in mean, convergence in distribution and convergence uniformly almost surely complex uncertain double sequences. In addition, relationships among the introduced classes of sequences have been introduced.

We suggest an algorithm for finding the group of birational automorphisms of a hyperelliptic curve y2 = p(x), p ∈ ℚ[x], over the field of complex numbers based on power series expansion. We present an implementation of this algorithm in the computer algebra system Sage and examples of its application. Computer experiments show that the algorithm does not lead to unexpectedly cumbersome calculations. The format of the group representation allows one to use the embedded Sage tools for dealing with finite groups of low order. Bibliography: 20 titles.

The main attention of this study is focused on the interaction dynamics of breather, and hybrid solitons and breather for an extended generalization of Vakhnenko equation. The general form of the N-order auxiliary function is first derived by the Hirota bilinear method. Then, the N-order solutions can be obtained. When $$N\ge 2$$ , the loop-like breather may emerge by taking the dispersion coefficients as conjugate complex number. The breather is like a magical spring with good elasticity, changeable period and thickness. Furthermore, novel interaction features between breathers, between soliton/solitons and breather/breathers, are observed by visualizing method. The results show that there are abundant dynamics during the interactions, such as elastic collision, phase shift, amplitude amplification, collapse and bulge effect.

The unwinding number of a complex number was introduced to process automatic computations involving complex numbers and multi-valued complex functions, and has been successfully applied to computations involving branches of the Lambert W function. In this partly expository note we discuss the unwinding number from a purely topological perspective, and link it to the classical winding number of a curve in the complex plane. We also use the unwinding number to give a representation of the branches $$W_k$$ W k of the Lambert W function as a line integral.

Given any n-tuple of complex numbers, one can canonically define a polynomial of degree n+1 that has the entries of this n-tuple as its critical points. In 2002, Beardon, Carne, and Ng studied a map $\theta\colon \mathbb{C}^n\to \mathbb{C}^n$ which outputs the critical values of the canonical polynomial constructed from the input, and they proved that this map is onto. Along the way, they showed that $\theta$ is a local homeomorphism whenever the entries of the input are distinct and nonzero, and, implicitly, they produced a polynomial expression for the Jacobian determinant of $\theta$. In this article we extend and generalize both the local homeomorphism result and the elegant determinant identity to analogous situations where the critical points occur with multiplicities. This involves stratifying $\mathbb{C}^n$ according to which coordinates are equal and generalizing $\theta$ to a similar map $\mathbb{C}^\ell \to \mathbb{C}^\ell$ where $\ell$ is the number of distinct critical points. The more complicated determinant identity that we establish is closely connected to the multinomial identity known as Dyson's conjecture., Comment: 13 pages

In 2011, Heittokangas et al. (Complex Var Ellipt Equat 56(1–4):81–92, 2011) proved that if a non-constant finite order entire function f(z) and $$f(z+\eta )$$ share a, b, c IM, where $$\eta $$ is a finite non-zero complex number, while a, b, c are three distinct finite complex values, then $$f(z)=f(z+\eta )$$ for all $$z\in \mathbb {C}$$ . We prove that if a non-constant finite order entire function f and its n-th difference operator $$\Delta ^n_{\eta }f$$ share $$a_1$$ , $$a_2$$ , $$a_3$$ IM, where n is a positive integer, $$\eta \ne 0$$ is a finite complex value, while $$a_1$$ , $$a_2$$ , $$a_3$$ are three distinct finite complex values, then $$f=\Delta ^n_{\eta }f$$ . The main results in this paper also improve Theorems 1.1 and 1.2 from Li and Yi (Bull Korean Math Soc 53(4):1213–1235, 2016).

International audience; Rigid graph theory is an active area with many open problems, especially regarding embeddings in R^d or other manifolds, and tight upper bounds on their number for a given number of vertices. Our premise is to relate the number of embeddings to that of solutions of a well-constrained algebraic system and exploit progress in the latter domain. In particular, the system's complex solutions naturally extend the notion of real embeddings, thus allowing us to employ bounds on complex roots. We focus on multihomogeneous Bézout (m-Bézout) bounds of algebraic systems since they are fast to compute and rather tight for systems exhibiting structure as in our case. We introduce two methods to relate such bounds to combinatorial properties of minimally rigid graphs in C^d and S^d. The first relates the number of graph orientations to the m-Bézout bound, while the second leverages a matrix permanent formulation. Using these approaches we improve the best known asymptotic upper bounds for planar graphs in dimension 3, and all minimally rigid graphs in dimension d ≥ 5, both in the Euclidean and spherical case. Our computations indicate that m-Bézout bounds are tight for embeddings of planar graphs in S^2 and C36. We exploit Bernstein's second theorem on the exactness of mixed volume, and relate it to the m-Bézout bound by analyzing the associated Newton polytopes. We reduce the number of checks required to verify exactness by an exponential factor, and conjecture further that it suffices to check a linear instead of an exponential number of cases overall.

Multicomplex and multidual numbers are two generalizations of complex numbers with multiple imaginary axes, useful for numerical computation of derivatives with machine precision. The similarities between multicomplex and multidual algebras allowed us to create a unified library to use either one for sensitivity analysis. This library can be used to compute arbitrary order derivates of functions of a single variable or multiple variables. The storage of matrix representations of multicomplex and multidual numbers is avoided using a combination of one-dimensional resizable arrays and an indexation method based on binary bitwise operations. To provide high computational efficiency and low memory usage, the multiplication of hypercomplex numbers up to sixth order is carried out using a hard-coded algorithm. For higher hypercomplex orders, the library uses by default a multiplication method based on binary bitwise operations. The computation of algebraic and transcendental functions is achieved using a Taylor series approximation. Fortran and Python versions were developed, and extensions to other languages are self-evident.

Summary The use of registrations is useful in shortening Mizar proofs [1], [2], both in terms of formalization time and article space. The proposed system of classes for complex numbers aims to facilitate proofs involving basic arithmetical operations and order checking. It seems likely that the use of self-explanatory adjectives could also improve legibility of these proofs, which would be an important achievement [3]. Additionally, some potentially useful definitions, following those defined for real numbers, are introduced.

The paper proposes a method of presentation topics «On the construction of a fundamental system of solutions of a linear homogeneous differential equation with constant coefficients of an arbitrary order». In the traditional presentation of this topic in the case when the characteristic equation has complex roots, the particular solutions of the equation corresponding to them are constructed by applying the elements of complex analysis. In consequence of that, for students in the field, whose training programs included the theory of linear differential equations with constant coefficients and at the same time does not include the study of the theory of complex analysis, types of private solving the equation in this case is given without substantiation, or as a known fact, only for this case, previously issued elements complex analysis. Offered in the presentation technique differs from the traditional presentation of the topic in that it partial solutions scheme for constructing fundamental system of homogeneous linear equation with constant coefficients of arbitrary order is based only on the basis of the properties of the differential form corresponding to the left side of the equation, without using the elements of the theory of complex analysis.

To a pair (X, f), where X is a compact ANR and f : X → 𝕊1 is a continuous angle valued map, a field κ, and a nonnegative integer r, one assigns a finite configuration of complex numbers z with multiplicities δfr (z) and a finite configuration of free κ[t−1, t]-modules $$ {\hat{\delta}}_r^f $$ of rank $$ {\delta}_r^f $$ (z) indexed by the same numbers z. This is in analogy with the configuration of eigenvalues and of generalized eigenspaces of a linear operator in a finite-dimensional complex vector space. The configuration $$ {\delta}_r^f $$ refines the Novikov–Betti number in dimension r, and the configuration $$ {\hat{\delta}}_r^f $$ refines the Novikov homology in dimension r associated with the cohomology class defined by f. In the case of the field κ = C, the configuration $$ {\hat{\delta}}_r^f $$ provides by “von-Neumann completion” of a configuration $$ {\hat{\hat{\delta}}}_r^f $$ of mutually orthogonal closed Hilbert submodules of the L2-homology of the infinite cyclic cover of X determined by the map f, which is an L∞(𝕊1)-Hilbert module.

We introduce and study the Hyers–Ulam stability (HUS) of a Cayley quantum (q-difference) equation of first order, where the constant coefficient is allowed to range over the complex numbers. In particular, if this coefficient is non-zero, then the quantum equation has Hyers–Ulam stability for certain values of the Cayley parameter, and we establish the best (minimal) HUS constant in terms of the coefficient only, independent of q and the Cayley parameter. If the Cayley parameter equals one half, then there is no Hyers–Ulam stability for any coefficient value in the complex plane.

Let Tc := D(x - c)((x - c)D + 2II) be a second-order linear differential operator, where c is an arbitrary complex number, $$D: = \frac{d}{{dx}}$$ and II represents the identity on the linear space of polynomials with complex coefficients. The aim of this paper is to describe all of the Tc-classical orthogonal polynomials. Two canonical situations appear: the Laguerre $$\{L_n^{(2)}\}_{n\geq0}$$ and the Jacobi $$\{P_n^{(\alpha-2,2)}\}_{n\geq0}$$

This work deals with the robust D-stability test of linear time-invariant &#x0028 LTI &#x0029 general fractional order control systems in a closed loop where the system and &#x002F or the controller may be of fractional order. The concept of general implies that the characteristic equation of the LTI closed loop control system may be of both commensurate and non-commensurate orders, both the coefficients and the orders of the characteristic equation may be nonlinear functions of uncertain parameters, and the coefficients may be complex numbers. Some new specific areas for the roots of the characteristic equation are found so that they reduce the computational burden of testing the robust D-stability. Based on the value set of the characteristic equation, a necessary and sufficient condition for testing the robust D-stability of these systems is derived. Moreover, in the case that the coefficients are linear functions of the uncertain parameters and the orders do not have any uncertainties, the condition is adjusted for further computational burden reduction. Various numerical examples are given to illustrate the merits of the achieved theorems.

The problem of determining $DS_n$, the complex numbers that occur as an eigenvalue of an $n$-by-$n$ doubly stochastic matrix, has been a target of study for some time. The Perfect-Mirsky region, $PM_n$, is contained in $DS_n$, and is known to be exactly $DS_n$ for $n \leq 4$, but strictly contained within $DS_n$ for $n = 5$. Here, we present a Boundary Conjecture that asserts that the boundary of $DS_n$ is achieved by eigenvalues of convex combinations of pairs of (or single) permutation matrices. We present a method to efficiently compute a portion of $DS_n$, and obtain computational results that support the Boundary Conjecture. We also give evidence that $DS_n$ is equal to $PM_n$ for certain $n > 5$.

We consider a class of plane orthotropic deformations of the form ex = σx + a12σy, γxy = 2(p − a12)Txy, ey = a12σx + σy, where σx, Txy, σy and$$ {\upvarepsilon}_x\frac{\upgamma_{xy}}{2},{\upvarepsilon}_Y $$ are components of the stress tensor and the deformation tensor, respectively, real parameters p and a12 satisfy the inequalities: -1 < p < 1, -1 < a12 < p. A class of solutions of the Lame equilibrium system for displacements is built in the form of linear combinations of components of “analytic” functions which take values in commutative and associative two-dimensional algebras with unity over the field of complex numbers.

In this paper we discuss the important Abel's summation formula, which is a very powerful tool for analysing series of real or complex numbers. We derive from it an integral test which may be usefu...

A complex fuzzy set, the generalization of fuzzy set provides a powerful mathematical framework whose membership degrees are in the form of complex numbers in the unit disc. The averaging operators consisting of the properties of both t-norm and t-conorm are of great importance in complex fuzzy environment. In this paper, we present certain quadratic averaging operators, including complex fuzzy weighted quadratic averaging, complex fuzzy ordered weighted quadratic averaging, complex fuzzy Einstein weighted quadratic averaging and complex fuzzy Einstein ordered weighted quadratic averaging operators. These operators are used to study many different issues of periodic nature. We apply these models to the multi-attribute decision-making problems and wireless detection of target location. Conclusively, we can choose the best opinion by the ranking of the aggregated outputs and detect the position and direction of a target. Moreover, we describe these models through numerical examples to check their validity and importance in real life problems. To explain the consistency and authenticity of our model, we examine a comparative analysis with existing aggregation techniques.

After a general discussion of group actions, orbifolds, and "weak orbifolds" this note will provide elementary introductions to two basic moduli spaces over the real or complex numbers: First the moduli space of effective divisors with finite stabilizer on the projective space ${\mathbb P}^1$ modulo the group ${\rm PGL}_2$ of projective transformations of ${\mathbb P}^1$; and then the moduli space of effective 1-cycles with finite stabilizer on ${\mathbb P}^2$ modulo the group ${\rm PGL}_3$ of projective transformations of ${\mathbb P}^2$.

Let $$a(\ne 0)$$, b be finite complex numbers, and $$k\ge 3$$ be a positive integer. If f is a meromorphic function of order $$\rho >2$$, then $$f^{\prime }-af^k-b$$ has infinitely many zeros on the complex plane.

Real-valued neural networks or complex-valued neural networks are sometimes inappropriate for some engineering and research problems for instance where the data is multi-dimensional, such as 4-D signals, color images and body images. Hence, researchers explored recently a more general and sophisticated model than the previous one, which is the quaternion-valued neural networks. The quaternions, which can also be defined as $$2\times 2$$ matrix of complex numbers, have the capacity to analyze three or more dimensional signals and represent spatial transformations. In this paper, some sufficient conditions are given for the existence and various kinds of stability for the unique Stepanov-like pseudo almost periodic solution of quaternion-valued fuzzy recurrent neural networks. The results are established by employing Lyapunov functionals, Nemytskii’s operator and Banach fixed point theorem. Also, a new direct method is used to establish our theoretical results in order to avoid the decomposition of the considered model into real-valued or complex-valued system. Finally, a numerical example is given to illustrate the validity of the obtained results.

Let $\mathcal{F}$ be a singular codimension one holomorphic foliation on a compact complex manifold $X$ of dimension at least three such that its singular set has codimension at least two. In this paper, we determine Lehmann-Suwa residues of $\mathcal{F}$ as multiples of complex numbers by integration currents along irreducible complex subvarieties of $X$. We then prove a formula that determines the Baum-Bott residue of simple almost Liouvillian foliations of codimension one, in terms of Lehmann-Suwa residues, generalizing a result of Marco Brunella. As an application, we give sufficient conditions for the existence of dicritical singularities of a singular real-analytic Levi-flat hypersurface $M\subset X$ tangent to $\mathcal{F}$.

A new approach for solving polynomial equations is presented in this study. Two techniques for solving quartic equations are described that are based on a new method which was recently developed for solving cubic equations. Higher order polynomial equations are solved by using a new and efficient algorithmic technique. The proposed methods rely on initially identifying the vicinities of the roots and do not require the use of complicated formulas, roots of complex numbers, or application of graphs. It is proposed that under the stated conditions, the methods presented provide efficient techniques to find the roots of polynomial equations.

Since Cheon et al. introduced an approximate homomorphic encryption scheme for complex numbers called Cheon-Kim-Kim-Song (CKKS) scheme, it has been widely used and applied in real-life situations, such as privacy-preserving machine learning. The polynomial approximation of a modulus reduction is the most difficult part of the bootstrapping for the CKKS scheme. In this article, we cast the problem of finding an approximate polynomial for a modulus reduction into an L2-norm minimization problem. As a result, we find an approximate polynomial for the modulus reduction without using the sine function, which is the upper bound for the approximation of the modulus reduction. With the proposed method, we can reduce the degree of the polynomial required for an approximate modulus reduction, while also reducing the error compared with the most recent result reported by Han et al. (CT-RSA' 20). Consequently, we can achieve a low-error approximation, such that the maximum error is less than 2-40 for the size of the message m/q ≈ 2-10. By using the proposed method, the constraint of q = O(m3/2) is relaxed as O(m), and thus the level loss in bootstrapping can be reduced. The solution to the cast problem is determined in an efficient manner without iteration.

As we know that the power series method is a very effective method for solving the Ordinary differential equations (ODEs) which have variable coefficient, so in this paper we have studied how to solve second-order ordinary differential equation with variable coefficient at a singular point t = 0 and determined the form of second linearly independent solution. Based on the roots of initial equation there are real and complex cases. When the roots of initial equation are real then there are three kinds of second linearly independent solutions. If the roots of the initial equation are distinct complex numbers, then the solution is complex-valued.

In this paper, using the first-order Nedelec conforming edge element space of the second type, we develop and analyze a continuous interior penalty finite element method (CIP-FEM) for the time-harmonic Maxwell equation in the three-dimensional space. Compared with the standard finite element methods, the novelty of the proposed method is that we penalize the jumps of the tangential component of its vorticity field. It is proved that if the penalty parameter is a complex number with negative imaginary part, then the CIP-FEM is well-posed without any mesh constraint. The error estimates for the CIP-FEM are derived. Numerical experiments are presented to verify our theoretical results.

Human being live in three-dimensional space; they can accurately visualize processes taking place in one, two and three dimensions. Although the set of bi-complex numbers and quaternion have attracted attention of many researchers in physics and related branches, they do not really represent processes taking place in the space where human being are located. We suggested a new set of complex number called “the Trinition”. The new set is comprised between complex number with one imaginary part and complex number with three imaginary parts called quaternion/bi-complex numbers. We established a bijection between the new set and the three-dimensional space. We presented some important properties of the new set. We showed that all chaotic attractors in three dimension are simply three-dimensional mapping in the new set. Fewer examples of mapping in such set were presented. A new methodology that can be used to obtain more strange attractors are equally suggested. The methodology combines fractional chaotic models and some fractal mapping within the new set. Some illustrative figures are presented.

The hybrid numbers are generalization of complex, hyperbolic and dual numbers. In this paper, we introduce and study the Fibonacci and Lucas hybrinomials, i.e. polynomials, which are a generalizati...

Purpose Discrete eigenvalues occur in eddy current problems in which the solution domain was truncated on its edge. In case of conductive material with a hole, the eigenvalues are complex numbers. Their computation consists of finding complex roots of a complex function that satisfies the electromagnetic interface conditions. The purpose of this paper is to present a method of computing complex eigenvalues that are roots of such a function. Design/methodology/approach The proposed approach involves precise determination of regions in which the roots are found and applying sets of initial points, as well as the Cauchy argument principle to calculate them. Findings The elaborated algorithm was implemented in Matlab and the obtained results were verified using Newton’s method and the fsolve procedure. Both in the case of magnetic and nonmagnetic materials, such a solution was the only one that did not skip any of the eigenvalues, obtaining the results in the shortest time. Originality/value The paper presents a new effective method of locating complex eigenvalues for analytical solutions of eddy current problems containing a conductive material with a hole.

Let f be a transcendental meromorphic function of finite order and c be a nonzero complex number. Define $\Delta _{c}f=f(z+c)-f(z)$ Δ c f = f ( z + c ) − f ( z ) . The authors investigate the existence on the fixed points of $\Delta _{c}f$ Δ c f . The results obtained in this paper may be viewed as discrete analogues on the existing theorem on the fixed points of $f'$ f ′ . The existing theorem on the fixed points of $\Delta _{c}f$ Δ c f generalizes the relevant results obtained by (Chen in Ann. Pol. Math. 109(2):153–163, 2013; Zhang and Chen in Acta Math. Sin. New Ser. 32(10):1189–1202, 2016; Cui and Yang in Acta Math. Sci. 33B(3):773–780, 2013) et al.

Clifford algebras are used for constructing spin groups, and are therefore of particular importance in the theory of quantum mechanics. An algebraist’s perspective on the many subgroups and subalgebras of Clifford algebras may suggest ways in which they might be applied more widely to describe the fundamental properties of matter. I do not claim to build a physical theory on top of the fundamental algebra, and my suggestions for possible physical interpretations are indicative only, and may not work. Nevertheless, both the existence of three generations of fermions and the symmetry-breaking of the weak interaction seem to emerge naturally from an extension of the Dirac algebra from complex numbers to quaternions.

The well-known quaternion algebra is a four-dimensional natural extension of the field of complex numbers and plays a significant role in various aspects of signal processing, particularly for representing signals wherein several instincts are to be controlled simultaneously. For efficient analysis of such quaternionic signals, we introduce the notion of linear canonical wavelet transform in quaternion domain by invoking the elegant convolution structure associated with the quaternion linear canonical transform. The preliminary analysis encompasses the study of fundamental properties of the proposed linear canonical wavelet transform in quaternion domain including the Rayleigh’s theorem, inversion formula and a characterization of the range. Subsequently, we formulate three uncertainty principles; viz, Heisenberg-type, logarithmic and local uncertainty inequalities associated with the linear canonical wavelet transform in quaternion domain.

Let $$f_\omega (z)=\sum \nolimits _{j=0}^{\infty }\chi _j(\omega ) a_j z^j$$ be a transcendental random entire function, where $$\chi _j(\omega )$$ are independent and identically distributed random variables defined on a probability space $$(\Omega , \mathcal {F}, \mu )$$ . In this paper, we study a family of random entire functions, which includes Gaussian, Rademacher, and Steinhaus entire functions. Then we prove that if two random entire functions in this family share two distinct complex numbers counting multiplicities, then they are identically equal.

Let k be a nonzero complex number. In this paper, we consider a k-circulant matrix whose first row is $$(Q_{1},Q_{2},\ldots ,Q_{n})$$ , where $$Q_{n}$$ is the nth Pell–Lucas number. The formulas for the eigenvalues of such matrix are obtained. Namely, the result which can be obtained from the result of Theorem 7. (Yazlik and Taskara, J Inequal Appl 2013:394, 2013) is improved. The obtained formulas for the eigenvalues of a k-circulant matrix involving the Pell–Lucas numbers show that the result of Theorem 8. (Jing, Li and Shen, WSEAS Trans Math 12(3):341-351, 2013) (i.e. Theorem 8. (Yazlik and Taskara 2013)) is not always applicable. The Euclidean norm of such matrix is determined. The upper and lower bounds for the spectral norm of a k-circulant matrix whose first row is $$(Q_{1}^{-1},Q_{2}^{-1},\ldots ,Q_{n}^{-1})$$ are also investigated. The obtained results are illustrated by examples. As a consequence of the previous results, the eigenvalues, the determinant, the Euclidean norm of a k-circulant matrix whose first row is $$(q_{1},q_{2},\ldots ,q_{n})$$ , where $$q_{n}$$ is the nth modified Pell number, are presented. Also, the upper and lower bounds for the spectral norm of a k-circulant matrix whose first row is $$(q_{1}^{-1},q_{2}^{-1},\ldots ,q_{n}^{-1})$$ are given

For regular continued fraction, if a real number [Formula: see text] and its rational approximation [Formula: see text] satisfying [Formula: see text], then, after deleting the last integer of the partial quotients of [Formula: see text], the sequence of the remaining partial quotients is a prefix of that of [Formula: see text]. In this paper, we show that the situation is completely different if we consider the Hurwitz continued fraction expansions of a complex number and its rational approximations. More specifically, we consider the set [Formula: see text] of complex numbers which are well approximated with the given bound [Formula: see text] and have quite different Hurwitz continued fraction expansions from that of their rational approximations. The Hausdorff and packing dimensions of such set are determined. It turns out that its packing dimension is always full for any given approximation bound [Formula: see text] and its Hausdorff dimension is equal to that of the [Formula: see text]-approximable set [Formula: see text] of complex numbers. As a consequence, we also obtain an analogue of the classical Jarník theorem in real case.

In this paper, we transfer the approach of finding the explicit solutions to linear impulsive differential equations (LIDEs) to quaternion-valued case. We develop the similar idea to find the solutions to LIDEs and give the details to derive the representations of the solutions to quaternion-valued LIDEs in the sense of complex numbers and quaternion. In addition, we present that two formulas are equivalent to each other. Finally, some examples are given to illustrate the theory approach.