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.

I investigate combinations of quasi-quanta expressions and how they yield alternatesolutions for expressions inMorphic Topology of Numeric Energy: A Fractal Morphism of Topological Counting Shows Real Differentiation of Numeric Energy. For Praising Jehovah, I do publish these mathematical gesturing forms from the infinity meaning of His word. Thanks mom! This quasi-quanta language package outlines methods for combining by topo- logical functor entanglement, symbolic, numeric-energy components. Methods, guidelines and algebraic rules for combining the quasi-quanta into the energy number equivalencies are also notated herein. The Quasi-Quanta Language Package is intended to show the symbolic pat- terns for configuring the quasi quanta symbology into the numeric energy ex- pressions. This should put to rest any doubt that Energy Numbers are indeed a real, logically configured phenomenon a priori to real or complex numbers, but optionally mappable to the real or complex plane. Pre-numeric energy symbol configurations offer a broad language of pat- tern detection and logical symbol operation delineated with particular solving methods herein. This hopefully provides a new way to looking at the branches of mathematics and their inter-operable analog functions. So, inevitably, we decompose the current perspective on numbers and prove a novel method for ordering and combining symbolic orientations.

This paper ensures an extensive survey of the generalization of the various hybrid numbers and hybrid polynomials especially as part of its enhancing importance in the disciplines of mathematics and physics. In this paper, by using the Horadam polynomials, we define the Horadam hybrid polynomials called Horadam hybrinomials. We obtain some special cases and algebraic properties of the Horadam hybrinomials such as recurrence relation, generating function, exponential generating function, Binet formula, summation formulas, Catalan's identity, Cassini's identity and d'Ocagne's identity, respectively. Moreover, we give some applications related to the Horadam hybrinomials in matrices.

As a new color image representation tool, quaternion has achieved excellent results in color image processing problems. In this paper, we propose a novel low-rank quaternion matrix completion algorithm to recover missing data of a color image. Motivated by two kinds of low-rank approximation approaches (low-rank decomposition and nuclear norm minimization) in traditional matrix-based methods, we combine the two approaches in our quaternion matrix-based model. Furthermore, the nuclear norm of the quaternion matrix is replaced by the sum of the Frobenius norm of its two low-rank factor quaternion matrices. Based on the relationship between the quaternion matrix and its equivalent complex matrix, the problem eventually is converted from the quaternion number domain to the complex number domain. An alternating minimization method is applied to solve the model. Simulation results on color image recovery show the superior performance and efficiency of the proposed algorithm over some tensor-based and quaternion-based ones.

We evaluate definite integrals of the form given by $\int_{0}^{\infty}R(a, x)\log (\cos (\alpha) \text{sech}(x)+1)dx$. The function $R(a, x)$ is a rational function with general complex number parameters. Definite integrals of this form yield closed forms for famous integrals in the books of Bierens de Haan [4] and Gradshteyn and Ryzhik [5].

In this work we present derivations of the formula listed in entry 4.113 in the sixth edition of Gradshteyn and Rhyzik's table of integrals. We evaluate two definite integrals of the form $ \begin{equation*} \int_{0}^{\infty}\frac{e^{-iay}(-iy+\log(z))^k+e^{iay}(iy+\log(z))^k}{\cosh(by)}dy \end{equation*} $ and $ \begin{equation*} \int_{0}^{\infty}\frac{e^{iay}(iy+\log(z))^k-e^{-iay}(-iy+\log(z))^k}{\sinh(b y)}dy \end{equation*} $ in terms of the Lerch function where $ k $, $ a $, $ z $ and $ b $ are arbitrary complex numbers. The entries in the table(s) are obtained as special cases in the paper below.

A list $\Lambda =\{\lambda_{1},\ldots,\lambda_{n}\}$ of complex numbers is said to be realizable, if it is the spectrum of an entrywise nonnegative matrix $A$. In this case, $A$ is said to be a realizing matrix. $\Lambda$ is said to be universally realizable, if it is realizable for each possible Jordan canonical form (JCF) allowed by $\Lambda$. The problem of the universal realizability of spectra is called the universal realizability problem (URP). Here, we study the centrosymmetric URP, that is, the problem of finding a nonnegative centrosymmetric matrix for each JCF allowed by a given list $\Lambda $. In particular, sufficient conditions for the centrosymmetric URP to have a solution are generated.

In this article I propose a new criterion to extend the Standard Model of particle physics from a straightforward algebraic conjecture: the symmetries of physical microscopic forces originate from the automorphism groups of main Cayley–Dickson algebras, from complex numbers to octonions and sedenions. This correspondence leads to a natural enlargement of the Standard Model color sector, from a SU(3) gauge group to an exceptional Higgs-broken G(2) group, following the octonionic automorphism relation guideline. In this picture, an additional ensemble of massive G(2)-gluons emerges, which is separated from the particle dynamics of the Standard Model.

In this paper, we suggested and analyzed a new higher-order iterative algorithm for solving nonlinear equation $$g(x)=0$$ g ( x ) = 0 , $$g:{\mathbb {R}}\longrightarrow {\mathbb {R}}$$ g : R ⟶ R , which is free from derivative by using the approximate version of the first derivative, and we studied the basins of attraction for the proposed iterative algorithm to find complex roots of complex functions $$g:{\mathbb {C}}\longrightarrow {\mathbb {C}}$$ g : C ⟶ C . To show the effectiveness of the proposed algorithm for the real and the complex domains, the numerical results for the considered examples are given and graphically clarified. The basins of attraction of the existing methods and our algorithm are offered and compared to clarify their performance. The proposed algorithm satisfied the condition such that $$|x_{m}-\alpha | | x m - α | < 1.0 × 10 - 15 , as well as the maximum number of iterations is less than or equal to 3, so the proposed algorithm can be applied to efficiently solve numerous type non-linear equations.

To each variety $X$ and a nonnegative integer $m$, there is a space $X_m$ over $X$, called the jet scheme of $X$ of order $m$, parametrizing $m$-th jets on $X$. Its fiber over a singular point of $X$ is called a singular fiber. For a surface with a rational double point, Mourtada gave a one-to-one correspondence between the irreducible components of the singular fiber of $X_m$ and the exceptional curves of the minimal resolution of $X$ for $m \gg 0$. In this paper, for a surface $X$ over complex number with a singularity of $A_n$ or $D_4$-type, we study the intersections of irreducible components of the singular fiber and construct a graph using this information. The vertices of the graph correspond to irreducible components of the singular fiber and two vertices are connected when the intersection of the corresponding components is maximal for the inclusion relation. In the case of $A_n$ or $D_4$-type singularity, we show that this graph is isomorphic to the resolution graph for $m \gg 0$., 18 pages

Direct computation of the discrete Fourier transform (DFT) and its FFT computational algorithms requires multiplication (and addition) of complex numbers. Complex number multiplication requires four real-valued multiplications and two real-valued additions, or three real-valued multiplications and five real-valued additions, as well as the requisite added memory for temporary storage. In this paper, we present a method for computing a DFT via a natively real-valued algorithm that is computationally equivalent to a N=2k-length DFT (where k is a positive integer), and is substantially more efficient for any other length, N. Our method uses the eigenstructure of the DFT, and the fact that sparse, real-valued, eigenvectors can be found and used to advantage. Computation using our method uses only vector dot products and vector-scalar products.

We prove that there exists a functorial correspondence between MV-algebras and partially cyclically ordered groups which are wound round of lattice-ordered groups. It follows that some results about cyclically ordered groups can be stated in terms of MV-algebras. For example, the study of groups together with a cyclic order allows to get a first-order characterization of groups of unimodular complex numbers and of finite cyclic groups. We deduce a characterization of pseudofinite MV-chains and of pseudo-simple MV-chains (i.e. which share the same first-order properties as some simple ones). We can generalize these results to some non-lineraly ordered MV-algebras, for example hyper-archimedean MV-algebras.

In this paper, we focus on two particularly problematic concepts in teaching mathematics: the complex unit i and angles. These concepts are naturally linked via De Moivre’s theorem but are independently misused in numerous contexts. We present definitions, notations, and ways of speaking about these terms from mathematics education that are not valid from a subject-specific point of view. We justify how these incorrectly used definitions, notations, and ways of speaking convey a false picture of the mathematical content and present options for introducing these concepts in classroom practice in a correct way.

Consider the universal gate set for quantum computing consisting of the gates X, CX, CCX, omega^dagger H, and S. All of these gates have matrix entries in the ring Z[1/2,i], the smallest subring of the complex numbers containing 1/2 and i. Amy, Glaudell, and Ross proved the converse, i.e., any unitary matrix with entries in Z[1/2,i] can be realized by a quantum circuit over the above gate set using at most one ancilla. In this paper, we give a finite presentation by generators and relations of U_n(Z[1/2,i]), the group of unitary nxn-matrices with entries in Z[1/2,i]., Comment: In Proceedings QPL 2021, arXiv:2109.04886

We provide a graphical treatment of SAT and #SAT on equal footing. Instances of #SAT can be represented as tensor networks in a standard way. These tensor networks are interpreted by diagrams of the ZH-calculus: a system to reason about tensors over C in terms of diagrams built from simple generators, in which computation may be carried out by transformations of diagrams alone. In general, nodes of ZH diagrams take parameters over C which determine the tensor coefficients; for the standard representation of #SAT instances, the coefficients take the value 0 or 1. Then, by choosing the coefficients of a diagram to range over B, we represent the corresponding instance of SAT. Thus, by interpreting a diagram either over the boolean semiring or the complex numbers, we instantiate either the decision or counting version of the problem. We find that for classes known to be in P, such as 2SAT and #XORSAT, the existence of appropriate rewrite rules allows for efficient simplification of the diagram, producing the solution in polynomial time. In contrast, for classes known to be NP-complete, such as 3SAT, or #P-complete, such as #2SAT, the corresponding rewrite rules introduce hyperedges to the diagrams, in numbers which are not easily bounded above by a polynomial. This diagrammatic approach unifies the diagnosis of the complexity of CSPs and #CSPs and shows promise in aiding tensor network contraction-based algorithms., Comment: In Proceedings QPL 2020, arXiv:2109.01534

Carl Johan Malmsten (1846) and David Beirens de Haan (1847) published work containing some interesting integrals. While no formal derivations of the integrals in his book Nouvelles Tables d'Integrales Defines are available in current literature deriving and evaluating such formulae are useful in all aspects of science and engineering whenever such formulae are used. Formulae in the book of Bierens de Haan are used in connection with certain potential problems where there is the need to determine the vector potential of two parallel, infinitely long, tubular rectangular conductors carrying cur-rents in opposite directions. In this current work we supply formal derivations for some of these integrals along with deriving some special cases as new integrals in order to expand upon the book of Bierens de haan to aid in potential research where these formulae are applicable. Updating book of integrals is always a useful exercise as it keeps the volume accurate and more useful for potential readers and researchers. Formal derivations are also useful as they help in verifying the correctness of integrals in such volumes. The definite integral we derived in this work is given by (1) in terms of the Lerch function, where the parameters a; k; m; and p are general complex numbers subject to their restrictions. This formal derivation is then used to derive the correct version of a definite integral transform along with new formulae. Some of the results in this work are new.

UDC 517.54 The aim of this work is to weaken the conditions of monogeneity for functions that take values in a given three-dimensional commutative algebra over the field of complex numbers. The monogeneity of the function is understood as a combination of its continuity and the existence of the Gateaux derivative.

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 λ < ρ .

We characterize the involutiveness of the linear combinations of the form $a{\bf{A}} + b{\bf{B}}$ when $a,b$ are nonzero complex numbers, ${\bf{A}}$ is a quadratic $n \times n$ nonzero matrix and ${\bf{B}}$ is an arbitrary $n \times n$ nonzero matrix, under certain properties imposed on $\bf{A}$ and $\bf{B}$. Moreover, we give some examples illustrating our main results.

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.

Upon reading the famous book on integral transforms volume II by Erdeyli et al., we encounter a formula which we use to derive a Mellin transform given by ∫ 0 ∞ x m − 1 log k a x / β 2 + x 2 γ + x d x , where the parameters a , k , β , and γ are general complex numbers. This Mellin transform will be derived in terms of the Lerch function and is not listed in current literature to the best of our knowledge. We will use this transform to create a table of definite integrals which can be used to extend similar tables in current books featuring such formulae.

This paper proposes a low-complexity method and architecture to compute the logarithm of complex numbers based on coordinate rotation digital computer (CORDIC). Our method takes advantage of the vector mode of circular CORDIC and hyperbolic CORDIC, which only needs shift-add operations in its hardware implementation. Our architecture has lower design complexity and higher performance compared with conventional architectures. Through software simulation, we show that this method can achieve high precision for logarithm computation, reaching the relative error of 10−7. Finally, we design and implement an example circuit under TSMC 28nm CMOS technology. According to the synthesis report, our architecture has smaller area, lower power consumption, higher precision and wider operation range compared with the alternative architectures.

The concept of complex numbers (CNs) is used in many disciplines. In many cases, students find it difficult to understand the logic behind CNs. Rotations, vibrations, and oscillations result in sine or cosine waves. Mathematical representation of rotation/vibration/oscillation is done in two ways—trigonometry and complex numbers. But the algebraic calculation is easier if CNs are used instead of trigonometric functions. The use of CNs as an effective representation of sinusoidal variations is discussed in this article.

We present a new theoretical approach to the processing of multidimensional and multicomponent images based on the theory of commutative hypercomplex algebras, which generalize the algebra of complex numbers. The main goal of the paper is to show that commutative hypercomplex numbers can be used in multichannel image processing in a natural and effective manner. We suppose that animal brains operate with hypercomplex numbers when processing multichannel retinal images. In our approach, each multichannel pixel is regarded as a $$K$$ -dimensional ( $$K$$ D) hypercomplex number rather than a $$K$$ D vector, where $$K$$ is the number of different optical channels. This creates an effective mathematical basis for various function–number transformations of multichannel images and invariant pattern recognition.

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.

Let $ f(z) $ be a transcendental meromorphic function of finite order and $ c\in\Bbb{C} $ be a nonzero constant. For any $ n\in\Bbb{N}^{+} $, suppose that $ P(z, f) $ is a difference polynomial in $ f(z) $ such as $ P(z, f) = a_{n}f(z+nc)+a_{n-1}f(z+(n-1)c)+\cdots+a_{1}f(z+c)+a_{0}f(z) $, where $ a_{k} (k = 0, 1, 2, \cdots, n) $ are not all zero complex numbers. In this paper, the authors investigate the uniqueness problems of $ P(z, f) $.

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.

Recurrent ladder network models are encountered in the analysis of many natural systems including wave propagation in transmission lines, porous electrode/electrolyte interfaces and viscoelastic (bio)materials. Here we re-visit the equivalent impedance of self-similar ladder networks composed of two arbitrary impedances recursively arranged, with the goal of correlating the behavior of the whole versus that of the part. We show that the macroscopic and microscopic scales are related via a generally complex-valued parametric scaling factor. We report on two new universal complex numbers that we denote as the Complex Golden Ratios . We also show that a lumped inductor (with its internal series resistance) or a lumped capacitor (with its parallel parasitic resistance) are actually equivalent to an infinite ladder network that involves resistors and imaginary resistors only. Finally, we show that the Cole-Davidson model, widely used in material characterization, naturally arises from the self-similar circuit ladder structure. Comparison with tree networks is also discussed.