Search

Gender is not only a spectrum; it is a complex number. Each individual has their own unique multidimensional number of gender. Gender as a complex number has developed from the gender algorithm. This conceptualization of gender is seated in theorizing gender from a Bayesian brain foundation, specifically the Free Energy Principle. The phenomenon of phantoms in transgender, transsexual, and nonbinary (TGNB) people has only recently been a subject of inquiry. This article builds on ideas developed through clinical practice and harvested from multidisciplinary theory and research. It applies my theories of interoceptive gender and the gender algorithm to formulations of gender. It will demonstrate how these relate to the theory of trans phantoms, which has important clinical implications and applications for TGNB subjectivity and embodiment. [ABSTRACT FROM AUTHOR]

In this paper, we focus on generalized fuzzy complex numbers and propose a straightforward matrix method to solve the dual rectangular fuzzy complex matrix equations C · Z ˜ + L ˜ = R · Z ˜ + W ˜ , in which C and R are crisp complex matrices and Z ˜ , L ˜ and M ˜ are fuzzy complex number matrices. The existing methods for solving fuzzy complex matrix equations involve separately calculating the extended solution and the corresponding parameters of the real and imaginary parts, whereby we obtain the algebraic solution of the equations. By means of the interval arithmetic and embedding approach, the n × n dual rectangular fuzzy complex linear systems could be converted into 2n × 2n fuzzy linear systems, which are also equivalent to the 4n × 4n real linear systems. By directly solving the 4n × 4n real linear systems, the algebraic solutions can be obtained. The general dual rectangular fuzzy complex matrix equations and dual rectangular fuzzy complex linear systems are investigated by the generalized inverses of matrices. Finally, some examples are given to illustrate the effectiveness of method. [ABSTRACT FROM AUTHOR]

For regular continued fraction, if a real number x and its rational approximation p / q satisfying | x − p / q | < 1 / q 2 , then, after deleting the last integer of the partial quotients of p / q , the sequence of the remaining partial quotients is a prefix of that of x. 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 E (ψ) of complex numbers which are well approximated with the given bound ψ 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 ψ and its Hausdorff dimension is equal to that of the ψ -approximable set W (ψ) of complex numbers. As a consequence, we also obtain an analogue of the classical Jarník theorem in real case. [ABSTRACT FROM AUTHOR]

Most any students can explain the meaning of a b , for a ∈ R and for b ∈ Z . And some students may be able to explain the meaning of (a + b i) c , for a , b ∈ R and for c ∈ Z . However, few may be able to explain a d i or a (c + d i) let alone (a + b i) (c + d i) for a , b , c , d ∈ R . Through both mathematical explanation and reader investigations via a dynamic graphing applet, we will investigate the meaning of (a + b i) (c + d i) . Additionally, we provide some course-appropriate investigations which can be used by instructors in various grades 11–16 courses. [ABSTRACT FROM AUTHOR]

In this article, we consider the problem of planar graph-based simultaneous localization and mapping (SLAM) that involves both poses of the autonomous agent and positions of observed landmarks. We present complex (CPL)-SLAM, an efficient and certifiably correct algorithm to solve planar graph-based SLAM using the complex number representation. We formulate and simplify planar graph-based SLAM as the maximum likelihood estimation on the product of unit complex numbers, and relax this nonconvex quadratic complex optimization problem to convex complex semidefinite programming (SDP). Furthermore, we simplify the corresponding complex SDP to Riemannian staircase optimization (RSO) on the complex oblique manifold that can be solved with the Riemannian trust region method. In addition, we prove that the SDP relaxation and RSO simplification are tight as long as the noise magnitude is below a certain threshold. The efficacy of this work is validated through applications of CPL-SLAM and comparisons with existing state-of-the-art methods on planar graph-based SLAM, which indicates that our proposed algorithm is capable of solving planar graph-based SLAM certifiably, and is more efficient in numerical computation and more robust to measurement noise than existing state-of-the-art methods. The C++ code for CPL-SLAM is available at https://github.com/MurpheyLab/CPL-SLAM. [ABSTRACT FROM AUTHOR]

This article introduces the space of A-linearly correlated fuzzy complex numbers. Using this space, we study the stationary Schrödinger equation with boundary conditions are given by fuzzy complex numbers. This equation plays an special role in Quantum Mechanics describing the state of the system. We apply the formalism to the step potential, generating quantum results consistent with traditional quantum results. [ABSTRACT FROM AUTHOR]

Here, we discuss the generalized Bernstein-Vazirani algorithm for determining a complex number string. The generalized algorithm presented here has the following structure. Given the set of complex values {a1, a2, a3,..., aN} and a special function g : C → C , we determine N real parts of values of the function l(a1), l(a2), l(a3),..., l(aN) and N imaginary parts of values of the function h(a1), h(a2), h(a3),..., h(aN) simultaneously. That is, we determine the N complex values g(aj) = l(aj) + ih(aj) simultaneously. We mention the two computing can be done in parallel computation method simultaneously. The speed of determining the string of complex values is shown to outperform the best classical case by a factor of N. Additionally, we propose a method for calculating many different matrices A, B, C,... into g(A), g(B), g(C),... simultaneously. The speed of solving the problem is shown to outperform the classical case by a factor of the number of the elements of them. We hope our discussions will give a first step to the quantum simulation problem. [ABSTRACT FROM AUTHOR]

In this paper, it is presented two math teachers' discourse analysis results, to identify the possible incidence of the metaphorical language used by them, in the learning of the concept of a complex number with ninth grade students. The analysis of the metaphorical language of the teacher is done in the light of the Cognitive Theory of Mathematics. It seeks the understanding of mathematics in the metaphorical thinking of people, and not in the rigorous demonstrations of books, emphasizing the connection that has the body with the cognitive processes, inducing the main key for the reform of teaching and learning processes focused on mathematical communication. [ABSTRACT FROM AUTHOR]

In this study, we compute the unitarily invariant norms of the matrices, Az = (zizj)ni, j = 1, Bz = (zi - zj)ni, j = 1,and Cz = (zi/zj)n1j = 1, where zis are ith components of any complex sequence (zn). Moreover, we give some corollaries and numerical examples related to norms of these matrices. [ABSTRACT FROM AUTHOR]

• The image Hash authentication algorithm for orthogonal moments of fractional order chaotic is proposed. • The image information is authenticated by the Hamming distance. • The robustness and tampering recognition accuracy of the proposed method is tested. In this paper, the image Hash authentication algorithm for orthogonal moments of fractional order chaotic scrambling coupling hyper-complex number Tchebichef is proposed. The improved PDE function and Ring segmentation mechanism are used to process the initial image and output the secondary image to improve the robustness of Hash's scaling and rotation; and by taking full account into the color information of the image, the image R, G and B position is regarded as its imaginary part. In addition, the invariant moment of the hyper-complex number Tchebichef is desgined, and the robust characteristics of the secondary image is fully extracted to greatly improve its ability to recognize the rotation tampering. At the same time, in order to improve the security of the Hash sequence, the fractional order Logistic mapping and chaotic scrambling technique is constructed to encrypt the eigenvector; and the image information is authenticated by the Hamming distance. Finally, the robustness and tampering recognition accuracy of the proposed Hash algorithm are tested. [ABSTRACT FROM AUTHOR]

The concept of unity roots plays a central role in the theory of field extensions and polynomials roots' computing. The objective of this paper is to find the algebraic formula for computing the symbolic 2-plithogenic and 3-plithogenic complex roots of unity, where a general formula will be provided with many related examples up to the exponent 3. [ABSTRACT FROM AUTHOR]

Retailers are facing with a variety of product information, how to help retailers access to effective commodity sales strategy effectively and accurately is an urgent problem. Based on complex network theory, this paper constructed a complex weighted network model of retail product association. Beginning with the relationship of retail product purchase in the consumer purchase record, retail products wrere nodes and the relationship of different product purchase wrere directed edge, and product sales volume wrere weights. And then, it calculated the node strength. Finally, it used the sales bill data from the K-commerce sites and supermarket to verify the algorithm. This study provided a reference basis for bundling sales, discount promotions and display layout strategies for E-commerce websites or large retailers. [ABSTRACT FROM AUTHOR]

A complete invariant defined for (closed, connected, orientable) 3-manifolds is an invariant defined for the 3-manifolds such that any two 3-manifolds with the same invariant are homeomorphic. Further, if the 3-manifold itself is reconstructed from the data of the complete invariant, then it is called a characteristic invariant defined for the 3-manifolds. In previous papers by the first author, a characteristic lattice point invariant and a characteristic rational invariant defined for the 3-manifolds were constructed which also produced a smooth real function with the definition interval ( − 1 , 1 ) as a characteristic invariant defined for the 3-manifolds. In this paper, a complex number-valued characteristic invariant for the 3-manifolds whose norm is smaller than or equal to one half is introduced by using an embedding of a set of lattice points called the ADelta set, distinct from the PDelta set, into the set of complex numbers. The distributive situation for the invariants of the 3-manifolds of lengths up to 10 is plotted in the complex number plane with radius smaller than or equal to one half. By using this complex number-valued characteristic invariant, a holomorphic function with the unit open disk as the definition domain which is called the characteristic quantity function is constructed as a characteristic invariant defined for the 3-manifolds. [ABSTRACT FROM AUTHOR]

This qualitative research, drawing on the theoretical frameworks by Even (1990, 1993) and Sfard (2007), investigated five high school mathematics teachers' geometric interpretations of complex number multiplication along with the roots of unity. The main finding was that mathematics teachers constructed the modulus, the argument, and the conjugate of a complex number along with the roots of unity through a series of discursive transformations without specifying the common terminology. While teachers exhibited a variety of visualizations, each founded in a diversity of approaches on the dynamic geometry software, writing mathematical expressions and equations proved challenging. Construction of roots of unity required teachers' mathematical proficiency—in particular, strategic competence in simultaneously coordinating various interpretations of complex numbers, and representational fluency in analytic geometrical and transformational reasoning. [ABSTRACT FROM AUTHOR]

The objective of this paper is to study for the first time the concept of square real matrices with symbolic 2-plithogenic split-complex entries. Many of their algebraic properties will be discussed and handled, where we find the formula of computing inverses, exponents, and powers of these matrices by building a ring isomorphism between the ring of split-complex symbolic 2-plithogenic matrices and the direct product of the symbolic 2-plithogenic matrices with itself. Also, we give the interested reader many related examples to clarify the validity of our work. [ABSTRACT FROM AUTHOR]

The fixed-time synchronization (FTS) of complex-valued memristive competitive neural networks (CVMCNNs) with mixed delays is the main topic of this paper. Firstly, two new fixed-time (FT) stability criteria are obtained. In the FT stability criterion, the exponent is usually positive, but the exponent can be less than zero and varies with the error state in this paper. Then, based on two new stability theorems, the FTS of CVMCNNs is studied in the sense of 1-norm and 2-norm, respectively, without dividing the complex-valued state variables into the real part (RP) and the imaginary part (IP). Finally, two numerical simulation examples are given to further demonstrate the validity and superiority of our results. [ABSTRACT FROM AUTHOR]

In this study, a different perspective was brought to Narayana sequences and one-, two-, three- and n --dimensional recurrence relations of these sequences were created. Then, some identities ranging from one to n --dimensions of these recurrences were created. [ABSTRACT FROM AUTHOR]

It plays an important role in the calculation of fuzzy numbers using some special fuzzy numbers to approximate general fuzzy numbers in fuzzy analysis, similar to fuzzy complex analysis. A method is proposed to seek an approximation operator that produces a special kind of fuzzy complex number which is the nearest one to a given fuzzy complex number in this paper. The concept of prismoid fuzzy complex number is introduced, and the nearest prismoid fuzzy complex number of fuzzy complex number which preserve the centroid of the core for the fuzzy complex number with respect to the weighted pseudometric are discussed. Finally, some properties of the approximation operator including scale invariance, identity and nearness are presented. [ABSTRACT FROM AUTHOR]

This paper aims to bring together quaternions and generalized complex numbers. Generalized quaternions with generalized complex number components are expressed and their algebraic structures are examined. Several matrix representations and computational results are introduced. An alternative approach for a generalized quaternion matrix with elliptic number entries has been developed as a crucial part. [ABSTRACT FROM AUTHOR]

The goal of this paper is to define for the first time the concept of symbolic 2-plithogenic weak fuzzy complex number as new generalization generated by combining real numbers with symbolic 2-plithogenic numbers. We study the elementary properties of this new class such as Invertibility and nilpotency, with many related examples that explain its novelty. [ABSTRACT FROM AUTHOR]

Recommendation can be reduced to a sub-problem of link prediction, with specific nodes (users and items) and links (similar relations among users/items, and interactions between users and items). However, previous link prediction approaches must be modified to suit recommendation instances because they neglect to distinguish the fundamental relations similar vs. dissimilar and like vs. dislike . Here, we propose a novel and unified way to cope with this deficiency, modeling the relational dualities using complex numbers. Previous works can still be used in this representation. In experiments with the MovieLens dataset and the Android software website AppChina.com, the proposed Complex Representation-based Link Prediction method (CORLP) achieves significant performance in accuracy and coverage compared with state-of-the-art methods. In addition, the results reveal several new findings. First, performance is improved, when the user and item degrees are taken into account. Second, the item degree plays a more important role than the user degree in the final recommendation. Given its notable performance, we are preparing to use the method in a commercial setting, AppChina.com, for application recommendation. [ABSTRACT FROM AUTHOR]

We show that the construction of the higher Gaudin Hamiltonians associated with the Lie algebra gl n admits an interpolation to any complex number n. We do this using the Deligne’s category D t , which is a formal way to define the category of finite-dimensional representations of the group G L n , when n is not necessarily a natural number. We also obtain interpolations to any complex number n of the no-monodromy conditions on a space of differential operators of order n, which are considered to be a modern form of the Bethe ansatz equations. We prove that the relations in the algebra of higher Gaudin Hamiltonians for complex n are generated by our interpolations of the no-monodromy conditions. Our constructions allow us to define what it means for a pseudo-differential operator to have no monodromy. Motivated by the Bethe ansatz conjecture for the Gaudin model associated with the Lie superalgebra gl n | n ′ , we show that a ratio of monodromy-free differential operators is a pseudo-differential operator without monodromy. [ABSTRACT FROM AUTHOR]

Classical matrix theory for real, complex and hypercomplex numbers is a well-known concept. Is it possible to construct matrix theory over dual-generalized complex (DGC) matrices? The answer to this question is given in this paper. The paper is constructed as follows. Firstly, the fundamental concepts for DGC matrices are introduced and DGC special matrices are defined. Then, theoretical results related to eigenvalues/eigenvectors are obtained and universal similarity factorization equality (USFE) regarding to the dual fundamental matrix are presented. Also, spectral theorems for Hermitian and unitary matrices are introduced. Finally, due to the importance of unitary matrices, a method for finding a DGC unitary matrix is stated and examples for spectral theorem are given. [ABSTRACT FROM AUTHOR]

This article introduces the idea of bicomplex valued S-metric space and deduces some of its features. Additionally, for bicomplex valued S-metric spaces, some fixed point results of contraction maps are shown to meet various categories of rational inequalities. Moreover, these results generalize certain significant, well-known results. An example is provided to highlight our major result. Furthermore, a theorem guaranteeing the existence of the one and only solution to the linear system of equations was developed using our main result. [ABSTRACT FROM AUTHOR]

Complex numbers have been studied in previous papers, but the papers did not deal with the conversion from algebraic form of a neutrosophic complex number form to exponential or trigonometric form and vice versa, and this prompted us to search for a method that facilitates this conversion process, as this paper dealt with how to move from algebraic form of a neutrosophic complex number to exponential or trigonometric form and vice versa, also, we discussed the roots from order n of a neutrosophic complex number, whether this number is given in algebraic or trigonometric form. [ABSTRACT FROM AUTHOR]

An elliptic curve E can be immersed in P N - 1 as a curve of degree N by means of the linear system of |NO|, where O is the origin of E. Well-known classical results going back to Bianchi and Klein say that if N is odd, this immersion is uniquely determined by specifying a full-level N structure. In this paper we show that if N is even, uniqueness of immersion is ensured by specifying a level structure associated with a certain congruence subgroup between Γ (N) and Γ (2 N) . Moreover, we construct, over the complex number field, an immersion by means of suitably chosen theta functions, and write down the quadratic equations satisfied by them. [ABSTRACT FROM AUTHOR]

Let r≥2 $r\ge 2$ be a real number. A complex nowhere‐zero r $r$‐flow on a graph G $G$ is an orientation of G $G$ together with an assignment φ:E(G)→C $\varphi :E(G)\to {\mathbb{C}}$ such that, for all e∈E(G) $e\in E(G)$, the Euclidean norm of the complex number φ(e) $\varphi (e)$ lies in the interval [1,r−1] $[1,r-1]$ and, for every vertex, the incoming flow is equal to the outgoing flow. The complex flow number of a bridgeless graph G $G$, denoted by ϕC(G) ${\phi }_{{\mathbb{C}}}(G)$, is the minimum of the real numbers r $r$ such that G $G$ admits a complex nowhere‐zero r $r$‐flow. The exact computation of ϕC ${\phi }_{{\mathbb{C}}}$ seems to be a hard task even for very small and symmetric graphs. In particular, the exact value of ϕC ${\phi }_{{\mathbb{C}}}$ is known only for families of graphs where a lower bound can be trivially proved. Here, we use geometric and combinatorial arguments to give a nontrivial lower bound for ϕC(G) ${\phi }_{{\mathbb{C}}}(G)$ in terms of the odd‐girth of a cubic graph G $G$ (i.e., the length of a shortest odd cycle) and we show that this lower bound is tight. This result relies on the exact computation of the complex flow number of the wheel graph Wn ${W}_{n}$. In particular, we show that for every odd n $n$, the value of ϕC(Wn) ${\phi }_{{\mathbb{C}}}({W}_{n})$ arises from one of three suitable configurations of points in the complex plane according to the congruence of n $n$ modulo 6. [ABSTRACT FROM AUTHOR]

A new approach for implementing the fast Fourier transform (FFT) using complex binary number system (CBNS) is presented in this paper. The advantage of using CBNS is that instead of processing the real and imaginary parts of a complex number separately, we can process both as a single entity. A total of four FFT architectures have been developed, which are 16‐, 64‐, 256‐, and 1024‐point FFT architectures. The proposed FFT is designed using Verilog‐HDL and implemented using a Virtex‐7 field‐programmable gate array (FPGA). The maximum clock rate achieved by the proposed FPGA‐based design is 376.1 MHz. The FPGA resource utilization of the FFT is less than the state‐of‐the‐art FFT designs. An application‐specific integrated circuit (ASIC) for the FFT is also designed. The normalized energy per FFT of the proposed ASIC is 0.14 nJ, and the normalized area per FFT of the ASIC is 1.08 mm2 which is less than other existing designs. [ABSTRACT FROM AUTHOR]

For two given idempotents p and q from an associative algebra A , in this paper, we offer a comprehensive classification of algebras spanned by the idempotents p and q. This classification is based on the condition that p and q are not tightly coupled and satisfy (p q) m − 1 = (p q) m but (p q) m − 2 p ≠ (p q) m − 1 p for some m (≥ 2) ∈ N. Subsequently, we categorize all the group invertible elements and establish an upper bound for the Drazin index of any elements in these algebras spanned by p , q. Moreover, we formulate a new representation for the Drazin inverse of α p + q under two different assumptions, (p q) m − 1 = (p q) m and λ (p q) m − 1 = (p q) m , where α is a non-zero and λ is a non-unit real or complex number. [ABSTRACT FROM AUTHOR]

The units of a number field k act naturally on the real vector space k ⊗ Q R , and so on open subsets of (k ⊗ Q R) ⁎ that are stable under the units. A Shintani domain for this action consists of a finite number of polyhedral cones, all having generators in k , whose union is a fundamental domain. Aside from the trivial case of imaginary quadratic fields, no practical method for computing Shintani domains for totally complex number fields has been published. Here we give a quick way to compute Shintani domains for totally complex quartic number fields. To construct these domains we exploit the existence of a forward attractor and backward repeller set for this action. We prove that the number of polyhedral cones needed for the Shintani domain is bounded by an absolute constant, a fact previously known only for cubic or quadratic fields. We also show that our algorithm for finding a Shintani domain runs in polynomial time and we give a table describing the results of running the algorithm on more than 168,000 fields. [ABSTRACT FROM AUTHOR]

Assume that is a faithful normal semifinite trace on a von Neumann algebra , is the unit of , is the -algebra of -measurable operators, and is the Banach space of -integrable operators. We present a new proof of the following generalization of Putnam's theorem (1951): No positive self-commutator with is invertible in . If is infinite then no positive self-commutator with can be of the form , where is a nonzero complex number and is a -compact operator. Given with we seek for the conditions that . If and with then . If and then . If a partial isometry lies in and for some integer then is a commutator and implies that . [ABSTRACT FROM AUTHOR]

In practical applications, the temporal completeness of knowledge graphs is of great importance. However, previous studies have mostly focused on static knowledge graphs, generally neglecting the dynamic evolutionary properties of facts. Moreover, the unpredictable and limited availability of temporal knowledge graphs, together with the complex temporal dependency patterns, make current models inadequate for effectively describing facts that experience temporal transitions. To better represent the evolution of things over time, we provide a learning technique that uses quaternion rotation to describe temporal knowledge graphs. This technique describes the evolution of entities as a temporal rotation change in quaternion space. Compared to the Ermitian inner product in complex number space, the Hamiltonian product in quaternion space is better at showing how things might be connected. This leads to a learning process that is both more effective and more articulate. Experimental results demonstrate that our learning method significantly outperforms existing methods in capturing the dynamic evolution of temporal knowledge graphs, with improved accuracy and robustness across a range of benchmark datasets. [ABSTRACT FROM AUTHOR]

Mandelbrot set, which was provided as a highlight in fractal and chaos, is studied by many researchers. With the extension of Mandelbrot set to generalized M set with different kinds of exponent k (k − M set), properties are hard to understand when k is a complex number. In this paper, fractal property of generalized M set with complex exponent z is studied. First, a relation is constructed between generalized M set with complex and real exponent. Then, distribution of z − M set on complex plane is researched. Meanwhile, symmetry of generalized M set is proved. Finally, graphics, generated by escape time algorithm, are the validated results of this paper. [ABSTRACT FROM AUTHOR]

Herein, we present a dynamic analysis on a Whitworth quick return mechanism, which was proposed as a class project to engage Mechanical Engineering students in the Machine Dynamics course. The objectives of the project are to teach (1) kinematic analysis on planar linkage mechanism using complex numbers and (2) kinetic analyses using distributed and lumped mass models. The analytical models were implemented using an engineering math software – Mathcad, and the results were validated by a multibody dynamics simulation software – Inventor. Loop closure equations were first built and solved to find link positions, and then velocities and accelerations were confirmed with numerical differentiation in Mathcad. Based on the solved kinematic quantities, a kinetic analysis was carried out using distributed and lumped mass models as well as in Inventor. The reactions and torques at the input link of the distributed mass model were found identical to those derived from Inventor. It was found the maximum reactions at pin joints were 11% to 100% different between the distributed mass model and the simplified lumped mass model. However, the shaking forces found in both models were nearly identical, and the peak values of the shaking moments were comparable. It is confirmed the lumped mass model can serve as a quick method to find the magnitude of the shaking forces and moments without solving simultaneous equation systems. [ABSTRACT FROM AUTHOR]

Since the product of complex numbers and rectangular fuzzy complex numbers (RFCN) is not necessarily a RFCN in the former fuzzy complex linear system (FCLS), the scalar multiplication and addition operations of complex numbers and fuzzy complex numbers (FCN) based on a new representation of FCN are proposed. We also introduce a new method for solving FCLS, which can convert FCLS into two distinct linear systems. One is an n × n complex linear system, and the other is an (m n) × (m n) real linear system, where n is the number of unknown variables, and m is the number of substitutional cyclic sets composed of coefficients of FCLS. In particular, using this method to solve one-dimensional fuzzy linear systems, a (2 n) × (2 n) RLS is obtained, which is consistent with Friedman's method. Finally, FCLS based on the RFCN as a special case are also investigated. [ABSTRACT FROM AUTHOR]

• We often deal with the combination of mutually perpendicular vectors of the normal and shear stress. • Although this is inconsistent with the principles of mathematics. • Mathematical compatibility is not fully valid in the criterion based on the concept by Macha. • It turns out that treating stress in the critical plane as a complex number results in an expression identical to Macha's criterion. This criterion by Macha has been repeatedly verified, analyzed and special cases of this criterion have been taken into account, reducing the complex stress to its uniaxial equivalent. Since both normal and shear stresses are vectors, we encounter the mathematical problem of adding these vectors, and the question arises how to consider the obtained equivalent stress, because two perpendicular vectors are added with weighting factors. Therefore, in this work it is proposed to adopt a system of complex numbers. Normal stress is defined here as a real part and shear stress as an imaginary part. As a result, on the basis of the defined complex number and based on pendulum bending and double-sided torsion, after transformations, the expression for equivalent stress proves to be identical to those previously defined on the basis of the concept of Macha. [ABSTRACT FROM AUTHOR]

In this paper, we propose a technique to solve LR-bipolar fuzzy linear system(BFLS), LR-complex bipolar fuzzy linear (CBFL) system with real coefficients and LR-complex bipolar fuzzy linear (CBFL) system with complex coefficients of equations. Initially, we solve the LR-BFLS of equations using a pair of positive (∗) and negative (∙) of two n × n LR-real linear systems by using mean values and left-right spread systems. We also provide the necessary and sufficient conditions for the solution of LR-BFLS of equations. We illustrate the method by using some numerical examples of symmetric and asymmetric LR-BFLS equations and obtain the strong and weak solutions to the systems. Further, we solve the LR-CBFL system of equations with real coefficients and LR-CBFL system of equations with complex coefficients by pair of positive (∗) and negative (∙) two n × n real and complex LR-bipolar fuzzy linear systems by using mean values and left-right spread systems. Finally, we show the usage of technique to solve the current flow circuit which is represented by LR-CBFL system with complex coefficients and obtain the unknown current in term of LR-bipolar fuzzy complex number. [ABSTRACT FROM AUTHOR]

Any complex-analytic vector bundle E admits naturally defined homotheties ϕ α , α ∈ C ⁎ , i.e. ϕ α is the multiplication of a local section by a complex number α. We investigate the question when such automorphisms can be lifted to a non-split supermanifold corresponding to E. Further, we compute the automorphism supergroup of a Π-symmetric super-Grassmannian Π Gr n , k , and, using Galois cohomology, we classify the real structures on Π Gr n , k and compute the corresponding supermanifolds of real points. [ABSTRACT FROM AUTHOR]

This work presents a novel approach to quantum computing by proposing a customizable hardware design of a dedicated processor that emulates the execution of quantum algorithms. Unlike software-based quantum computation simulators, which run on standard general-purpose computers and suffer from reduced performance, this hardware design, which is based on classical concepts of bits, registers and memories, aims to leverage pure parallelism and pipelined execution for efficient quantum computations via emulation. The architecture includes several key components: memories, computation unit, measurement unit and control unit. The quantum state memory stores the individual and group states of qubits. This memory is crucial for maintaining the quantum information required for quantum operations. Basic operators are stored in dedicated operator memory. Additionally, a scratch memory allows for larger operators to be dynamically built at runtime. The computation unit is responsible for performing complex number multiplications, which form the basis of tensor and matrix products necessary for executing quantum operations. A measurement unit enables quantum state sampling, which is an essential aspect of quantum computation. Furthermore, a control unit is incorporated to ensure the correct operation of the quantum processor's data path. It utilizes a microprogram to manage and coordinate the functional units. All the functional units communicate with each other through dedicated and shared data buses, depending on the frequency of information exchange. This enables efficient data transfer and coordination among the components. The proposed hardware design has been simulated and proved to be effective in executing quantum operations. By exploiting parallelism and employing a pipelined execution, this architecture overcomes the limitations of software-based simulators, delivering improved performance for emulating quantum algorithms. We use Grover's search algorithm as a benchmark to evaluate the performance of the proposed hardware design and compare it to software-based simulation and to hardware-based algorithm-dedicated emulation. [ABSTRACT FROM AUTHOR]

Recent progress has revealed a number of constraints that cosmological correlators and the closely related field-theoretic wavefunction must obey as a consequence of unitarity, locality, causality and the choice of initial state. When combined with symmetries, namely homogeneity, isotropy and scale invariance, these constraints enable one to compute large classes of simple observables, an approach known as (boostless) cosmological bootstrap. Here we show that it is possible to relax the restriction of scale invariance, if one retains a discrete scaling subgroup. We find an infinite class of solutions to the weaker bootstrap constraints and show that they reproduce and extend resonant non-Gaussianity, which arises in well-motivated models such as axion monodromy inflation. We find no evidence of the new non-Gaussian shapes in the Planck data. Intriguingly, our results can be re-interpreted as a deformation of the scale-invariant case to include a complex order of the total energy pole, or more evocatively interactions with a complex number of derivatives. We also discuss for the first time IR-divergent resonant contributions and highlight an inconsequential inconsistency in the previous literature. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a membership function used to form the fuzzy Mandelbric set and investigate the structural effects of additive and multiplicative dynamic noises on it. The newly defined membership function of this fuzzy set and its perturbations is a generalization of the indicator function for the classical Mandelbric set. We present an algorithm for detecting each complex number's fuzzy membership degree. Through the use of the membership degrees of each complex number and experimental mathematics based on the visualizations of a variety of versions by utilizing computer-aided design, we gain a deep foresight for the structure characteristics of the additive and multiplicative perturbed fuzzy Mandelbric sets. Our novel approach allows us to identify the symmetry states of the Mandelbric set and its perturbations by the membership degrees of complex numbers, unlike the existing methods described in the literature. [ABSTRACT FROM AUTHOR]

We derive computable formulas for the structured backward errors of a complex number λ when considered as an approximate eigenvalue of rational matrix functions that carry a symmetry structure. We consider symmetric, skew-symmetric, Hermitian, skew-Hermitian, ∗ -palindromic, T-even, T-odd, ∗ -even, and ∗ -odd structures. Numerical experiments show that the backward errors with respect to structure-preserving and arbitrary perturbations are significantly different. [ABSTRACT FROM AUTHOR]

In this paper, we associate the TKK algebra G ˆ (J) with vertex algebras through twisted modules. Firstly, we prove that for any complex number ℓ , the category of restricted G ˆ (J) -modules of level ℓ is canonically isomorphic to the category of σ -twisted V C g ˆ (ℓ , 0) -modules, where V C g ˆ (ℓ , 0) is a vertex algebra arising from the toroidal Lie algebra of type C 2 and σ is an isomorphism of V C g ˆ (ℓ , 0) induced from the involution of this toroidal Lie algebra. Secondly, we prove that for any nonnegative integer ℓ , the integrable restricted G ˆ (J) -modules of level ℓ are exactly the σ -twisted modules for the quotient vertex algebra L C g ˆ (ℓ , 0) of V C g ˆ (ℓ , 0). Finally, we classify the irreducible 1 2 N -graded σ -twisted L C g ˆ (ℓ , 0) -modules. [ABSTRACT FROM AUTHOR]

Complex-valued expression models have been widely used in the application of intelligent decision systems. However, there is a lack of entropy to measure the uncertain information of the complex-valued information. Therefore, how to reasonably measure the uncertain information of the complex-valued information is a gap to be filled. In this paper, inspired by the Rényi entropy, we propose the complex-valued Rényi entropy, which measures uncertain information of the complex-valued probability under the framework of complex number, and this is also the first time to measure uncertain information in the complex space. The complex-valued Rényi entropy contains the features of the classical Rényi entropy, i.e., the complex-valued Rényi entropy corresponds to different information functions with different parameters q. Moreover, complex-valued Rényi entropy has some properties, such as non-negativity, monotonicity and etc. Some numerical examples can demonstrate the flexibility and reasonableness of the complex-valued Rényi entropy. [ABSTRACT FROM AUTHOR]

Consider orbits (z , κ) of the fractal iterator f κ (z) : = z 2 + κ , κ ∈ ℂ , that start at initial points z ∈ K ̂ κ (m) ⊂ ℂ ̂ , where ℂ ̂ is the set of all rational complex numbers (their real and imaginary parts are rational) and K ̂ κ (m) consists of all such z whose complexity does not exceed some complexity parameter value m (the complexity of z is defined as the number of bits that suffice to describe the real and imaginary parts of z in lowest form). The set K ̂ κ (m) is a bounded-complexity approximation of the filled Julia set K κ . We present a new perspective on fractals based on an analogy with Chaitin's algorithmic information theory, where a rational complex number z is the analog of a program p , an iterator f κ is analogous to a universal Turing machine U which executes program p , and an unbounded orbit (z , κ) is analogous to an execution of a program p on U that halts. We define a real number Υ κ which resembles Chaitin's Ω number, where, instead of being based on all programs p whose execution on U halts, it is based on all rational complex numbers z whose orbits under f κ are unbounded. Hence, similar to Chaitin's Ω number, Υ κ acts as a theoretical limit or a "fractal oracle number" that provides an arbitrarily accurate complexity-based approximation of the filled Julia set K κ . We present a procedure that, when given m and κ , it uses Υ κ to generate K ̂ κ (m) . Several numerical examples of sets that estimate K ̂ κ (m) are presented. [ABSTRACT FROM AUTHOR]

From the perspective of rock mechanics, transmission of fluid pressure that drives groundwater flow is not instantaneous; instead it is a slow compressional (P) wave in porous rocks saturated with a fluid. In this paper, the approach of monochromatic wave is used to analyze the slow P‐wave. Permeability is derived as a function of the frequency of the wave. The permeability appears to be a complex number which asymptotes to Darcy permeability at the low frequency end but tends to vanish at the high frequency end. With Biot theory, the permeability predicts phase velocity and the quality factor of the monochromatic wave. Using Berea sandstone as an illustrative example, the complex‐number permeability can yield a lower phase velocity (within frequency of 105–108 Hz) and a larger attenuation (for frequency above 106 Hz) than Darcy permeability does. This study extends the recent research of the low‐frequency waves of fluid pressure to the regime of very high frequency. [ABSTRACT FROM AUTHOR]

Matrix factorizations in dual number algebra, a hypercomplex number system, have been applied to kinematics, spatial mechanisms, and other fields recently. We develop an approach to identify spatiotemporal patterns in the brain such as traveling waves using the singular value decomposition (SVD) of dual matrices in this paper. Theoretically, we propose the compact dual singular value decomposition (CDSVD) of dual complex matrices with explicit expressions as well as a necessary and sufficient condition for its existence. Furthermore, based on the CDSVD, we report on the optimal solution to the best rank-k approximation under a newly defined quasi-metric in the dual complex number system. The CDSVD is also related to the dual Moore--Penrose generalized inverse. Numerically, comparisons with other available algorithms are conducted, which indicate less computational costs of our proposed CDSVD. In addition, the infinitesimal part of the CDSVD can identify the true rank of the original matrix from the noise-added matrix, but the classical SVD cannot. Next, we employ experiments on simulated time-series data and a road monitoring video to demonstrate the beneficial effect of the infinitesimal parts of dual matrices in spatiotemporal pattern identification. Finally, we apply this approach to the large-scale brain functional magnetic resonance imaging data, identify three kinds of traveling waves, and further validate the consistency between our analytical results and the current knowledge of cerebral cortex function. [ABSTRACT FROM AUTHOR]

This is a further discussion of a previous work of the author on tensors with different rank and symmetric rank. We point out several obstructions towards extending a complex number example to the real number setting and discuss several further questions raised in the literature. [ABSTRACT FROM AUTHOR]