Algebra Equations Research Articles

On the Possibility of Scientific Philosophy for Satisfactory Solution of the Problem of Interrelation of Classical and Quantum Physics

As we know the main results of quantum physics in 1900 Planck began to obtain mainly because of the need to describe the experimental data. Therefore, it further became necessary to obtain theoretical justifications for these results. This means to obtain proofs of these results on the basis of the basic equations of theoretical physics, i.e. equations that are obtained on the way where the right choice of results is made performing the role of the basis of the theory of thought. As is known, these problems began to be solved, taking as a basis the possibilities of the following new ideas of Bohr. That quantum physics should be considered as a generalization of classical physics. But as we know, this path led to the results of matrix mechanics. Results for which such contradiction as non-commutativity of multiplication is inherent. In this paper for obtaining proofs for the results of Planck's quantum physics the fundamental ideas in the field of scientific philosophy were taken as a basis. That is philosophy where from the very beginning for the basis of the theory of thinking the possibilities of equations of algebra and arithmetic are accepted

Overcoming the gap between knowledge and use in mathematical flexibility: Examining the role of inhibitory control

BackgroundPrevious research in the domain of equation solving has shown that although students obtain knowledge of multiple strategies, they often use a standard but less efficient strategy. This phenomenon has been framed as a gap between knowledge and use. AimsWe aim to examine whether using a standard strategy might be a dominant response and whether inhibitory control is needed for students to overcome the knowledge-use gap. Samples284 college students participated in the study (nPilot study = 114, nStudy1 = 62, nStudy2 = 108). MethodsA time-pressure and a no-choice design was used to examine the frequency of using standard strategies, and the accuracy and speed of using the standard and efficient strategies, respectively (Pilot study). Students completed a dual-inhibition task and a negative priming (NP) task (Study 1). Students’ strategy use was examined in a delayed NP adaptation and a delay intervention in the classroom (Study 2). ResultsStudents used standard strategies more frequently under time pressure, indicating the dominance of the standard strategy, even though using efficient strategies was faster. Their performance of using efficient strategies was impaired when inhibition resources were occupied; the observed NP effect reflected the inhibition of the standard strategy when using efficient strategies. A delay intervention improved students’ inhibition process and facilitated their flexibility performance. ConclusionThis study revealed that applying the standard strategy is often the default tendency for solving algebra equations, and inhibitory control is critical in bridging the gap between possessing knowledge of various strategies and implementing them in mathematical practice.

Infinite-dimensional Lie bialgebras via affinization of perm bialgebras and pre-Lie bialgebras

It is known that the operads of perm algebras and pre-Lie algebras are the Koszul dual each other and hence there is a Lie algebra structure on the tensor product of a perm algebra and a pre-Lie algebra. Conversely, we construct a special perm algebra structure and a special pre-Lie algebra structure on the vector space of Laurent polynomials such that the tensor product with a pre-Lie algebra and a perm algebra being a Lie algebra structure characterizes the pre-Lie algebra and the perm algebra respectively. This is called the affinization of a pre-Lie algebra and a perm algebra respectively. Furthermore we extend such correspondences to the context of bialgebras, that is, there is a bialgebra structure for a perm algebra or a pre-Lie algebra which could be characterized by the fact that its affinization by a quadratic pre-Lie algebra or a quadratic perm algebra respectively gives an infinite-dimensional Lie bialgebra. In the case of perm algebras, the corresponding bialgebra structure is called a perm bialgebra, which can be independently characterized by a Manin triple of perm algebras as well as a matched pair of perm algebras. The notion of the perm Yang-Baxter equation is introduced, whose symmetric solutions give rise to perm bialgebras. There is a correspondence between symmetric solutions of the perm Yang-Baxter equation in perm algebras and certain skew-symmetric solutions of the classical Yang-Baxter equation in the infinite-dimensional Lie algebras induced from the perm algebras. In the case of pre-Lie algebras, the corresponding bialgebra structure is a pre-Lie bialgebra which is well-constructed. The similar correspondences for the related structures are given.

Calibrated representations of the double Dyck path algebra

AbstractThe double Dyck path algebra $$\mathbb {A}_{q,t}$$ A q , t and its polynomial representation first arose as a key figure in the proof of the celebrated Shuffle Theorem of Carlsson and Mellit. A geometric formulation for an equivalent algebra $$\mathbb {B}_{q,t}$$ B q , t was then given by the second author and Carlsson and Mellit using the K-theory of parabolic flag Hilbert schemes. In this article, we initiate the systematic study of the representation theory of the double Dyck path algebra $$\mathbb {B}_{q,t}$$ B q , t . We define a natural extension of this algebra and study its calibrated representations. We show that the polynomial representation is calibrated, and place it into a large family of calibrated representations constructed from posets satisfying certain conditions. We also define tensor products and duals of these representations, thus proving (under suitable conditions) the category of calibrated representations is generically monoidal. As an application, we prove that tensor powers of the polynomial representation can be constructed from the equivariant K-theory of parabolic Gieseker moduli spaces.

Symbolic computation in algebra, geometry, and differential equations

In this survey article we describe how symbolic computation in algebra and geometry leads to symbolic, i.e., formula solutions of algebraic differential equations. Symbolic solutions of algebraic differential equations can be derived from parametrizations of corresponding algebraic varieties. Such parametrizations in turn can be computed by elimination methods, i.e., methods for solving systems of polynomial equations.

Dissimilar subalgebras of symmetry algebra of plasticity equations

In this paper we construct the optimal sets of dissimilar subalgebras up to dimension three for the Lie algebra of point symmetries of the system of three-dimensional stationary equations of perfect plasticity with the Huber–von Mises yield condition. The obtained results can be used to solve the problem of determining all invariant solutions of this system. It was necessary to design algorithms to facilitate some steps of the classification of subalgebras. The computational algebraic system SageMath was chosen to implement these algorithms. The most used functions and procedures are listed. The developed algorithms can be adapted to classify subalgebras of higher dimensions.

Ontological description method for building service-oriented distributed learning systems

The subject of the research is the analysis and justification of the use of software engineering processes based on ontologies of data access and representation of access to knowledge bases and knowledge reuse in the language of algebra of finite predicates, which is a class of descriptive logics. This approach allows you to use the advantages of ontologies and logic programming in the refactoring of distributed distance learning systems. The purpose of the work is to create a formalism for describing the interaction of services and algorithms for building web service interfaces for the implementation of an effective SOA system using the paradigm of access to data based on ontologies. To achieve the goal, the following tasks were solved: an analysis of the main types of interaction structures of SOA services, an overview of implementations of systems working with a family of descriptive logic languages, namely, algebra of finite predicates, and a description of the structure of the ontology necessary for the operation of service-oriented systems, which has the markup of the Semantic Web standard using finite predicate algebra equations. The task is an urgent task of ensuring the organization of interaction of Internet resources in the development of distributed virtual learning systems, and such interaction is enabled by the service-oriented architecture of software development. The article examines modern technologies of the Semantic Web and their role in ensuring the creation of applied software systems of distributed learning resources built using distributed interactive services. The considered methods and materials include methods of algebra of finite predicates, theory of algorithms, object-oriented design, theory of unification. The results. The semantics of the SOA system is obtained, which makes it possible to describe SOA systems in the languages of descriptive logic. The effectiveness of the mathematical formalism of the algebra of finite predicates for the tasks of logical analysis of applied ontologies, the use of knowledge reuse methods, and the description of service-oriented systems is shown. The necessity of using algorithms for automatic construction of web interfaces is shown. The conclusions of the work highlight the advantages of the researched solution, namely, algorithms for the automated construction of web service interfaces for SOA architecture, which make it possible to automatically build web service interfaces. Algorithms differ in a more general model and speed of work and require an assessment of complexity.

CRAMER’S RULE IN MIN-PLUS ALGEBRA

Cramer’s rule is one of a method for solving a system of linear equations in conventional algebra. The system of linear equation can be solved using Cramer’s rule if . Max-plus algebra is a set where is a set of real numbers, equipped with biner operations and where and . Min-plus Algebra is a set where is a set of real numbers, equipped with biner operations and where and . In max-plus algebra has been formulated Cramer’s rule to solve a system of linear equations. Because max-plus algebra is isomorphic to min-plus algebra, Cramer’s rule can be formulated into min-plus algebra. The purpose of this research is to determine the sufficient conditions for a system of linear equations can be solved using Cramer’s rule. The method used in this research is a literature study that reviews previous research related to min-plus algebra, max-plus algebra, and Cramer’s rule in max-plus algebra. By using the appropriate analogy in max-plus algebra, we can determine the sufficient conditions so that a system of linear equations in min-plus algebra can be solved using Cramer’s rule. Based on the research, the sufficient conditions for a system of linear equations can be solved using Cramer’s rule are for and with the Cramer’s rule is . For an invertible matrix A, Cramer’s rule can be written as .

A linearly implicit finite element full-discretization scheme for SPDEs with nonglobally Lipschitz coefficients

Abstract The present article deals with strong approximations of additive noise driven stochastic partial differential equations (SPDEs) with nonglobally Lipschitz nonlinearity in a bounded domain $ \mathcal{D} \in{\mathbb{R}}^{d}$, $ d \leq 3$. As the first contribution, we establish the well-posedness and regularity of the considered SPDEs in space dimension $d \le 3$, under more relaxed assumptions on the stochastic convolution. This improves relevant results in the literature and covers both the space-time white noise ($d=1$) and the trace-class noises ($\text{Tr} (Q) < \infty $) in multiple dimensions $d=2,3$. Such an improvement is achieved based on a key perturbation estimate for a perturbed PDE, with the aid of which we prove the convergence and uniform regularity of a spectral approximation of the SPDEs and thus get the improved regularity results. The second contribution of the paper is to propose and analyze a spatio-temporal discretization of the SPDEs, by incorporating a standard finite element method in space and a linearly implicit nonlinearity-tamed Euler method for the temporal discretization. The proposed time-stepping scheme is linearly implicit and does not suffer from solving nonlinear algebra equations as the backward Euler scheme does. Based on the improved regularity results, we recover the expected strong convergence rates of the fully discrete scheme and reveal how the convergence rates rely on the regularity of the noise process. In particular, a classical convergence rate of order $O(h^{2} +\tau )$ can be obtained even in high dimension $d=3$, as the driven noise is of trace class and satisfies certain regularity assumptions. The optimal error estimates turn out to be challenging and face some essential difficulties when the tamed time-stepping scheme meets the finite element spatial discretization, particularly in the context of low regularity and multiple dimensions $d \le 3$. Some highly nontrivial arguments are introduced to overcome the difficulties. Finally, numerical examples corroborate the claimed strong orders of convergence.

Legendre Galerkin spectral collocation least squares method for the Darcy flow in homogeneous medium and non-homogeneous medium

The Darcy's equation consists of the mass conservation equation and the Darcy's law that involves the hydraulic potential (or called pressure) and the fluid velocity, which governs the flow of an incompressible fluid through a porous medium. In this paper, we investigate the Legendre Galerkin spectral collocation least squares method for approximating the problem of Darcy flow in homogeneous medium and non-homogeneous medium, respectively. The proposed scheme can be solved the approximate solutions of the hydraulic potential and the average velocity of the fluid simultaneously. A symmetric positive definite coefficient matrix of the corresponding linear algebra equation is obtained by applying our scheme. Numerical examples are presented to validate the efficiency and accuracy of the proposed scheme.

Symmetry and symmetric transformations in mathematical imaging

The article delves into the intricate relationship between symmetry and mathematical imaging, spanning various mathematical disciplines. Symmetry, a concept deeply ingrained in mathematics, manifests in art, nature, and physics, providing a powerful tool for understanding complex structures. The paper explores three types of symmetriesreflection, rotational, and translationalexemplified through concrete mathematical expressions. Evariste Galoiss Group Theory emerges as a pivotal tool, providing a formal framework to understand and classify symmetric operations, particularly in the roots of polynomial equations. Galois theory, a cornerstone of modern algebra, connects symmetries, permutations, and solvability of equations. Group theory finds practical applications in cryptography, physics, and coding theory. Sophus Lie extends group theory to continuous spaces with Lie Group Theory, offering a powerful framework for studying continuous symmetries. Lie groups find applications in robotics and control theory, streamlining the representation of transformations. Benoit Mandelbrots fractal geometry, introduced in the late 20th century, provides a mathematical framework for understanding complex, self-similar shapes. The applications of fractal geometry range from computer graphics to financial modeling. Symmetrys practical applications extend to data visualization and cryptography. The article concludes by emphasizing symmetrys foundational role in physics, chemistry, computer graphics, and beyond. A deeper understanding of symmetry not only enriches perspectives across scientific disciplines but also fosters interdisciplinary collaborations, unveiling hidden order and structure in the natural and designed world. The exploration of symmetry promises ongoing discoveries at the intersection of mathematics and diverse fields of study.

New Accurate Flexural Analysis for Different Types of Plates in a Rectangular Sewage Tank by Utilizing a Unified Analytic Solution Procedure

In the present paper, a modified Fourier series approach is developed for new precise flexural analysis of three different types of concrete plates in a rectangular sewage tank. The bending problems of the bottom plate, side-plate, and the fluid-guiding plate are not easily solved via using the traditional analytic approaches. Based on the Fourier series theory, the present approach provides a unified semi-inverse solving procedure for the above plates by means of choosing three different kinds of Fourier series as the trial functions. Although all the trial functions are quite similar to the classical Navier-form solution, new, precise analytic flexural solutions for plates without Navier-type edge conditions (all edges simply-supported) are achieved, which is mainly attributed to employing the Stoke’s transform technique. For each case, the plate-bending problems are finally altered to deal with linear algebra equations. Furthermore, owing to the orthogonality and completeness of the Fourier series, the obtained solutions perfectly satisfy both the edge conditions and the governing partial differential equation of plates, which paves an easily implemented and rational way for engineers and researchers to provide new, exact designs of plate structures. The main contribution of this study lies in the provision of a unified solution procedure for addressing complex plate-bending problems across diverse boundary conditions. By employing a range of Fourier series types, this approach offers a comprehensive solution framework that accommodates the complexities inherent in plate analysis. The correctness of the present analytic solutions is verified against precise finite element method (FEM) results and ones available in the literature. Finally, the influences of foundation, edge conditions, and aspect ratio on flexural behaviors of plates are discussed in detail.

New Natural Frequency Studies of Orthotropic Plates by Adopting a Two-Dimensional Modified Fourier Series Method

The free vibration behavior of orthotropic thin plates, which are clamped at three edges and free at one edge, is a matter of great concern in the engineering field. Various numerical/approximate approaches have been proposed for the present problem; however, lack precise analytic benchmark solutions are lacking in the literature. In the present study, we propose a modified two-dimensional Fourier series method to effectively handle free vibration problems of plates under various edge conditions. In the given solution, the adopted trial function automatically satisfies several boundary conditions. After imposing Stoke’s transformation in the trial function and letting it satisfy the remaining boundary conditions, we can change the present plate problem into calculating several systems of linear algebra equations which are easily handled. The present method can be regarded as an easily implemented, rational, and rigorous approach, as it can exactly satisfy both the governing equation and the associated edge conditions. Another advantage of the present method over other analytical approaches is that it has general applicability to various boundary conditions through the utilization of different types of Fourier series, and it can be extended for the further dynamic/static analysis of plates under different shear deformation theories. Finally, all the novel analytical solutions are confirmed to be sufficiently accurate since they match well with the FEM results. The new analytic solution obtained may serve as a benchmark for validating other numerical and approximate methods.

Spectral-Galerkin method for second kind VIEs with highly oscillatory kernels of the stationary point

In this paper, we discuss an efficient spectral approach for solving a class of second kind VIEs with highly oscillatory kernels possessing the stationary point. First, we use one variable transform to convert the highly oscillatory problem into the long-time one, and then split the long-time problem into a linear system of integral equations by using a dilation approach. Next on each interval we study the characteristic of the original solution and then propose an efficient spectral-Galerkin method for solving the linear system of integral equations. We prove that the proposed algorithm requires to solve the number O(log2⁡ω) of linear algebra equations of order n+1 and reaches the convergence order O(n−r), where r denotes the degree of the regularity of the original solution and ω denotes the wave number. Moreover, we give the approach of computing the highly oscillatory integrals produced in the spectral-Galerkin method. At last, two numerical examples are provided to verify the efficiency of our proposed method.

Tropical Modeling of Battery Swapping and Charging Station

We propose and investigate a queueing model of a battery swapping and charging station (BSCS) for electric vehicles (EVs). A new approach to the analysis of the queueing model is developed, which combines the representation of the model as a stochastic dynamic system with the use of the methods and results of tropical algebra, which deals with the theory and applications of algebraic systems with idempotent operations. We describe the dynamics of the queueing model by a system of recurrence equations that involve random variables (RVs) to represent the interarrival time of incoming EVs. A performance measure for the model is defined as the mean operation cycle time of the station. Furthermore, the system of equations is represented in terms of the tropical algebra in vector form as an implicit linear state dynamic equation. The performance measure takes on the meaning of the mean growth rate of the state vector (the Lyapunov exponent) of the dynamic system. By applying a solution technique of vector equations in tropical algebra, the implicit equation is transformed into an explicit one with a state transition matrix with random entries. The evaluation of the Lyapunov exponent reduces to finding the limit of the expected value of norms of tropical matrix products. This limit is then obtained using results from the tropical spectral theory of deterministic and random matrices. With this approach, we derive a new exact formula for the mean cycle time of the BSCS, which is given in terms of the expected value of the RVs involved. We present the results of the Monte Carlo simulation of the BSCS’s operation, which show a good agreement with the exact solution. The application of the obtained solution to evaluate the performance of one BSCS and to find the optimal distribution of battery packs between stations in a network of BSCSs is discussed. The solution may be of interest in the case when the details of the underlying probability distributions are difficult to determine and, thus, serves to complement and supplement other modeling techniques with the need to fix a distribution.

Rees algebras of sparse determinantal ideals

We determine the defining equations of the Rees algebra and of the special fiber ring of the ideal of maximal minors of a 2 × n 2\times n sparse matrix. We prove that their initial algebras are ladder determinantal rings. This allows us to show that the Rees algebra and the special fiber ring are Cohen-Macaulay domains, they are Koszul, they have rational singularities in characteristic zero and are F-rational in positive characteristic.

Extension dimensions of derived and stable equivalent algebras

The extension dimensions of an Artin algebra give a reasonable way of measuring how far an algebra is from being representation-finite. In this paper we mainly study the behavior of the extensions dimensions of algebras under different equivalences. We show that the difference of the extension dimensions of two derived equivalent algebras is bounded above by the length of the tilting complex associated with the derived equivalence, and that the extension dimension is an invariant under the stable equivalence. In addition, we provide two sufficient conditions such that the extension dimension is an invariant under particular derived equivalences.

Tetrahedron equation and quantum cluster algebras

We develop the quantum cluster algebra approach recently introduced by Sun and Yagi to investigate the tetrahedron equation, a three-dimensional generalization of the Yang-Baxter equation. In the case of square quiver, we devise a new realization of quantum Y-variables in terms q-Weyl algebras and obtain a solution that possesses three spectral parameters. It is expressed in various forms, comprising four products of quantum dilogarithms depending on the signs in decomposing the quantum mutations into the automorphism part and the monomial part. For a specific choice of them, our formula precisely reproduces Sergeev’s R matrix, which corresponds to a vertex formulation of the Zamolodchikov-Bazhanov-Baxter model when q is specialized to a root of unity.

Separation of variables for the classical elliptic reflection equation algebra

In the present paper we construct separation of variables (SoV) for all Lax-integrable systems, two by two Lax matrix of which enjoys classical reflection equation algebra with the elliptic r−s matrices. We show that, similar to the cases of SoV for the classical XYZ and XXZ models [1,2], the constructed SoV admits two types of momenta, which are important in the quantum case [1,2]. We consider two examples of such the integrable hamiltonian systems governed by the simplest Poisson brackets connected with classical reflection equation algebra with the elliptic r−s matrices. They are the classical Sklyanin algebra and its four-dimensional extension which provide a quadratic structure for the classical Steklov top. We explicitly construct the variables of separation, Abel equations and reconstruction formulae for the corresponding integrable models.

Deciding Equations in the Time Warp Algebra

Join-preserving maps on the discrete time scale $\omega^+$, referred to as time warps, have been proposed as graded modalities that can be used to quantify the growth of information in the course of program execution. The set of time warps forms a simple distributive involutive residuated lattice -- called the time warp algebra -- that is equipped with residual operations relevant to potential applications. In this paper, we show that although the time warp algebra generates a variety that lacks the finite model property, it nevertheless has a decidable equational theory. We also describe an implementation of a procedure for deciding equations in this algebra, written in the OCaml programming language, that makes use of the Z3 theorem prover.