Search

This study was performed to determine preservice elementary mathematics teachers' solution performance of systems of linear equations using geometric representation, algebraic representation and transition from geometric representation to the algebraic representation and the predictive role of preservice elementary mathematics teachers' performance of different representation usage on their systems of linear equations self-efficacy perceptions. The research follows the prediction model, which is one of the relational screening models. The data were obtained by using the 'Systems of Linear Equations Self-Efficacy Test' developed by Kardes [Kardes, D. (2010). Matematik ögretmen adaylarinin lineer denklem sistemleri çözüm süreçlerinin öz-yeterlik algisi ve çoklu temsil baglaminda incelenmesi [An investigation of the processes of pre-services mathematics teachers? Solving systems of linear equations within the context of self-efficacy and multiple representations] [Master's thesis]. Marmara University. Turkish Higher Education Council thesis repository (#264144). https://tez.yok.gov.tr/UlusalTezMerkezi/] and the 'Systems of Linear Equations Performance Test' developed by the researchers. Because of the research, it was found out that preservice teachers' algebraic representation performances and their self-efficacy perceptions were at the maximum level when the number of equations and unknown variables was equal (m = n). Additionally, due to the multiple regression analysis, preservice teachers' performances on geometric representation, the transition from geometric representation to algebraic representation and systems of linear equations in R[superscript 3] were determined to be significant predictors of their self-efficacy perception. [This study was presented as a verbal announcement at the International Symposium on Active Learning-ISAL 2019 symposium.]

The paper describes the results of a study whose main aim was to find the interrelationship between pupils' school grades in Czech language (native), mathematics, and physics and pupils' cognitive predispositions to problem-solving in science and mathematics diagnosed by the Lawson Classroom Test of Scientific Reasoning and the Culture of Problem Solving test. A total of 180 pupils from the Czech Republic aged 14-15 took part in this study. The results show that pupils with better grades in the monitored subjects achieve better results in both tests. It also turns out that there are generally statistically insignificant differences between the results of pupils assessed by grades 1 or 2 and between those assessed by grades 3 or 4. Pupils' performance in the two tests might help to strengthen the objectivization of grading at school. They might also help identify the indicators important for developing problem-solving skills. The research specifically points to the need to develop algebraic thinking, the conception of infinity, spatial imagination, geometric imagination in the plane, proportional reasoning, and the ability to control variables.

Gaming the system is a persistent problem in Computer-Based Learning Platforms. While substantial progress has been made in identifying and understanding such behaviors, effective interventions remain scarce. This study uses a method of causal moderation known as Fully Latent Principal Stratification to explore the impact of two types of interventions--gamification and manipulation of assistance access on the learning outcomes of students who tend to game the system. The results indicate that gamification does not consistently mitigate these negative behaviors. One gamified condition had a consistently positive effect on learning regardless of students' propensity to game the system, whereas the other had a negative effect on gamers. However, delaying access to hints and feedback may have a positive effect on the learning outcomes of those gaming the system. This paper also illustrates the potential for integrating detection and causal methodologies within educational data mining to evaluate effective responses to detected behaviors.

In Victoria, Australia, senior secondary mathematics students are expected to use technology and thus need to make decisions about using pen-and-paper (P&P) or technology when solving mathematics problems. The predominant technology is a Computer Algebra System (CAS). This study investigated the beliefs about CAS held by twelve Year 11 students as they learnt to use CAS and whether these beliefs were stable over time. These students held a range of beliefs related to the usefulness of CAS, speed of CAS compared to P&P, whether CAS is proper mathematics, choice of CAS or P&P, ease of use, the correctness of answers and solving problems in Mathematical Methods (i.e. the mathematics subject studied). Beliefs are often described as being stable (e.g. McLeod, 1992), but some researchers stress stability needs to be determined empirically rather than being seen as a characteristic of beliefs (e.g. Liljedahl et al., 2012). For this sample of students, stability (rather than instability) is a feature of students' beliefs about CAS.

This paper is part of broader research being conducted in the area of algebraic thinking in primary education. Our general research objective was to identify and describe generalization of a 2nd grade student (aged 7-8). Specifically, we focused on the transition from arithmetic to algebraic generalization. The notion of structure and its continuity in the generalization process are important for this transition. We are presenting a case study with a semi-structured interview where we proposed a task of contextualized generalization involving the function y = x + 3. Special attention was given to the structures evidenced and the type of generalization expressed by the student in the process. We noted that the student identified the correct structure for the task during the interview and that he evidenced a factual type of algebraic generalization. Due to the student's identification of the appropriate structure and the application of it to other different particular cases, we have observed a transition from arithmetic thinking to algebraic thinking.

This paper addresses the recent body of research in algebra and algebraic thinking from 2018 to 2022. We reviewed 74 journal articles and identified four clusters of content areas: (a) literal symbols and symbolizing, (b) equivalence and the equal sign, (c) equations and systems, and (d) functions and graphing. We present the research on each of these content clusters, and we discuss insights on effective teaching practices and the social processes supporting algebraic reasoning. The research base shows that incorporating algebraic thinking into the elementary grades, emphasizing analytic and structural thinking processes, and emphasizing covariational reasoning supports students' meaningful learning of core algebraic ideas. We close with a discussion of the major theoretical contributions emerging from the past five years, offering suggestions for future research.

In this paper we review selected significant developments in the use of digital technology in the teaching and learning of mathematics over the last five years. We focus on a number of important topics in this field, including the evolvement of STEAM and critical making as well as the process of redefining learning spaces in the transformation of the mathematics classroom. We also address the increasing use of computer algebra systems and dynamic geometry packages; and the issue of student collaboration online, especially using learning environments and social media. We briefly touch on artificial intelligence systems, including hyper-personalisation of learning, multimodality and videos. We include a brief discussion on the impact of COVID-19 on mathematics education, and lastly on the more theoretical perspective of the epistemology of digital technology and the construct of humans-with-media. We conclude the discussion with some possible concerns and mentioning some possible new topics for research in the field.

The concept of function is critical in mathematics in general and abstract algebra in particular. We observe, however, that much of the research on functions in abstract algebra (1) reports widespread student difficulties, and (2) focuses on specific types of functions, including binary operation, homomorphism, and isomorphism. Direct, detailed examinations of the function concept itself--and such fundamental properties as well-definedness and everywhere-definedness--are scarce. To this end, in this paper we examine non-examples of function in abstract algebra by conducting a textbook analysis and semi-structured interviews with abstract algebra instructors. In doing so, we propose four key categories based upon the definitive function properties of well-definedness and everywhere-definedness. These categories identify specific characteristics of the kinds of non-examples of function that abstract algebra instruction should emphasize, enabling us to hypothesize how students might be able to develop a robust view of function and explain in greater detail the nature of the reported difficulties that students experience.

An important topic of study in secondary mathematics is non-linear functions, including quadratic equations. In this study, findings from 25 Year 11 students indicated that difficulties with critical prerequisite concepts such as algebraic conventions impeded students' success in understanding and working with quadratics. Analysis of student errors identified misconceptions associated with the null factor law, and the nature of quadratic equations. This paper proposes that these findings are a result of limited timeframes nominated for learning quadratic topics outlined in the enacted curriculum. The implication of this is that the enactment of the Australian Curriculum: Mathematics F-10 did not support the development of conceptual understanding or procedural fluency with key mathematical concepts for these students. Without purposeful attention to prerequisite knowledge, and suitable time allocated to develop understanding and fluency, students' proficiency with topics such as quadratics is negatively influenced. A mastery approach to the hierarchically organised curriculum is supported by findings of this study.

QR decomposition is widely used for solving the least squares problem. However, existing materials about it may be too abstract for non-mathematicians, especially STEM students, and/or require serious background in linear algebra. The paper describes theoretical background and examples of GNU Octave compatible MATLAB scripts that give relatively simple but complete explanations about how to use QR decomposition for the least squares problem solution. Only basic knowledge of linear algebra and calculus are required. Both Givens rotations and Householder reflections usage for the linear least squares problem were considered. It was shown that the algorithm based on Givens rotations is even easier to program than explicit formation of the normal equations with subsequent usage of Gaussian elimination.

Numerous studies affirm the importance of students' attitudes for mathematical education. This study uses mathematical autobiographical essays to examine the mathematical experiences and attitudes of undergraduate students enrolled in mathematics classes at a Midwestern University in the United States. The essays of 41 students (20 men, 21 women) out of 170 enrolled in College Algebra, Precalculus, and Calculus were analyzed using the categories of (1) confidence in mathematics ability, (2) value of mathematics, and (3) liking of mathematics. This paper provides context and theoretical depth to student reports of their attitudes in these categories. Statements at the intersections of both confidence and liking, and value and liking provide additional insights. First, students who perceive mathematics as valuable are more likely to like it. Second, the vast majority of students talk about confidence and liking together, and with a positive correlation. Further, these students tend to talk about liking or not liking mathematics because of their perceived ability in mathematics. Our study suggests the importance of proactive teaching strategies to improve students' perceptions of the value, liking of, and their confidence in, mathematics, and also suggests self-efficacy as a potential theoretical basis for this work.

Recent research has highlighted the role of functional relationships in introducing elementary school students to algebraic thinking. This functional approach is here considered to study essential components of algebraic thinking such as generalization and its representation, as well as the strategies used by students and their connection with generalization. This paper jointly describes the strategies and representations of generalization used by a group of 33 sixth-year elementary school students, with no former algebraic training, in two generalization tasks involving a functional relationship. The strategies applied by the students differed depending on whether they were working on specific or general cases. To answer questions on near specific cases they resorted to counting or additive operational strategies. As higher values or indeterminate quantities were considered, the strategies diversified. The correspondence strategy was the most used and the common approach when students generalized. Students were able to generalize verbally as well as symbolically and varied their strategies flexibly when changing from specific to general cases, showing a clear preference for a functional approach in the latter.

This paper reports on a novel corequisite design and implementation for College Algebra at Florida International University. The corequisite course uses online, just-in-time, prerequisite assignments delivered on an open-educational platform. Students get help from near-peer learning assistants inside a math emporium environment. The course remains three credits after the redesign and now supports all students who would otherwise be taking Intermediate Algebra as a prerequisite course.

This paper describes Alkaline, a size-reduced version of Kyber, which has recently been announced as a prototype NIST standard for post-quantum public-key cryptography. While not as simple as RSA, I believe that Alkaline can be used in an undergraduate classroom to effectively teach the techniques and principles behind Kyber and post-quantum cryptography in general. Classroom experiences with individual concepts used in Alkaline support this belief. In addition to cryptography, linear algebra and abstract algebra classes would be good candidates for the use of Alkaline. A few exercises suitable for use in these classes are included.

The Miller-Rabin test is a useful probabilistic method for finding large primes. In this paper, we explain the method in detail and give three variations on this test. These variations were originally developed as student projects to supplement a course in error correcting codes and cryptography.

Backward transfer is defined as the influence that new learning has on individuals' prior ways of reasoning. In this article, we report on an exploratory study that examined the influences that quadratic functions instruction in real classrooms had on students' prior ways of reasoning about linear functions. Two algebra classes and their teachers at two comprehensive high schools served as the participants. Both schools drew from low-socioeconomic urban populations. The study involved paper-and-pencil assessments about linear functions that were administered before and after a four- to five-week instructional unit on quadratic functions. The teachers were instructed to teach the quadratic functions unit using their regular approach. Qualitative analysis revealed three kinds of backward transfer influences and each influence was related to a shift in how the students reasoned about functions in terms of an action or process view of functions. Additionally, features of the instruction in each class provided plausible explanations for the similarities and differences in backward transfer effects across the two classrooms. These results offer insights into backward transfer, the relationship between prior knowledge and new learning, aspects of reasoning about linear functions, and instructional approaches to teaching functions.

In this paper, we examine the relationships between teachers' subject matter preparation and experience in teaching and their performance on an instrument measuring mathematical knowledge for teaching Algebra 1. We administered the same instrument to two different samples of teachers-high school practicing teachers and community college faculty--who teach the same algebra content in different levels of institutions, and we compared the performance of the two different samples and the relationships between the measured knowledge and their educational and teaching background across the samples. The comparison suggested that the community college faculty possess a higher level of mathematical knowledge for teaching Algebra 1 than high school teachers. The subsequent analyses using the Multiple Indicator Multiple Causes (MIMIC) models based on our hypothesis on the factors contributing to the differences in the knowledge between the two teacher samples suggest that experience teaching advanced algebra courses has positive effects on the mathematical knowledge for teaching Algebra 1 in both groups. Highlighting the positive effect of algebra-based teaching experience on test performance, we discuss the implications of the impact of subject specific experience in teaching on teachers' mathematical content knowledge for teaching.

This paper discusses several linear algebra activities designed to help enhance students' skills in collaborating, exploring mathematics, and linking together abstract and visual ways of approaching mathematics. Most of these activities are short, accessible, engaging, and easy to incorporate into any classroom. In addition, we discuss some questions instructors can ask themselves to design novel and engaging activities when constrained to teaching from a particular curriculum.

Nowadays, researchers are very interested in studying various Diophantine equations due to their importance in Cryptography, Chemistry, Knot Theory, Astronomy, Geometry, Trigonometry, Biology, Algebra, Electrical Engineering, Economics, and Astrology. The present paper is about the non-negative integer solution of the exponential Diophantine equation nx + 43y = z², where are non-negative integers, is a positive integer with nx + 43y = z², where n = 2 (mod 129) and n + 1 and is not a perfect square. The authors use the famous Catalan conjecture for this purpose. Results of the present paper indicate that 2, 3, 0, and 3 are the only required values of and respectively, that satisfy the exponential Diophantine equation, where are non-negative integers, is a positive integer with nx + 43y = z², where n = 2 (mod 129) and n + 1 and is not a perfect square. The present technique of this paper proposes a new approach to solving the Diophantine equations, which is the main scientific contribution of this study, and it is very beneficial, especially for researchers, scholars, academicians, and people interested in the same field. [ABSTRACT FROM AUTHOR]

This paper considers theoretical foundations and mathematical methods of data analysis under the conditions of the Rice statistical distribution. The problem involves joint estimation of the signal and noise parameters. It is shown that this estimation requires the solution of a complex system of essentially nonlinear equations with two unknown variables, which implies significant computational costs. This study is aimed at mathematical optimization of computer algebra methods for numerical solution of the problem of Rician data analysis. As a result of the optimization, the solution of the system of two nonlinear equations is reduced to the solution of one equation with one unknown variable, which significantly simplifies algorithms for the numerical solution of the problem, reduces the amount of necessary computational resources, and enables the use of advanced methods for parameter estimation in information systems with priority of real-time operation. Results of numerical experiments carried out using Wolfram Mathematica confirm the effectiveness of the developed methods for two-parameter analysis of Rician data. The data analysis methods considered in this paper are useful for solving many scientific and applied problems that involve analysis of data described by the Rice statistical model. [ABSTRACT FROM AUTHOR]

This paper generalizes the notion of monadic residuated lattices to that of pseudo monadic residuated lattices. As monadic residuated lattices serve as algebraic models of modal logic S5(FLew), we propose pseudo monadic residuated lattices as algebraic models of modal system KD45(FLew). The main contributions of this paper are as follows: 1) we discuss the relationship between pseudo monadic residuated lattices and other pseudo monadic algebraic structures, showing that it is a natural generalization of pseudo monadic BLalgebras, Bi-modal Gödel algebras and pseudo monadic algebras; 2) We provide a comprehensive characterization of pseudo monadic residuated lattices by considering them as pairs of residuated lattices (L,B), where B represents a special case of a relatively complete subalgebra of L known as c-relatively complete. Furthermore, we establish a necessary and sufficient condition for a subalgebra to be c-relatively complete. [ABSTRACT FROM AUTHOR]

In this paper, we have generalized the numerous conversion steps into one equation to find the exponents of each prime factor in the prime factorization of Πk=mn k!, where m,n are any positive integers and mk=mn k!, using series notation with the generalized equation to demonstrate possible applications of the equation. [ABSTRACT FROM AUTHOR]

The modified RSA provides high efficiency against attacks and, as a result, it is considered the ideal choice for many applications. In this paper, we introduce an alternative to the modified RSA key encryption system called TPRSA, based on Tri-Cartesian algebra and polynomials, by modifying the mathematical structure of text encryption and decryption keys to obtain a high level of security. [ABSTRACT FROM AUTHOR]

Let X be a complex Banach space, and denote by \mathcal {B}(X) the algebra of all bounded linear operators on X. Let C,D\in \mathcal {B} \left (X\right) be fixed operators. In this paper, we characterize linear, continuous and bijective maps \varphi and \psi on \mathcal {B}\left (X\right) for which there exist invertible operators T_0, W_0 \in \mathcal { B}(X) such that \varphi (T_0), \psi (W_0) \in \mathcal {B}(X) are both invertible, having the property that \varphi \left (A\right) \psi \left (B\right) =D in \mathcal {B}(X) whenever AB=C in \mathcal {B}(X). As a corollary, we deduce the form of linear, bijective and continuous maps \varphi on \mathcal {B}(X) having the property that \varphi \left (A\right) \varphi \left (B\right) =D in \mathcal {B}(X) whenever AB=C. [ABSTRACT FROM AUTHOR]

In this short paper, we derive a new result on Umehara algebra. As a consequence, we prove that an indefinite complex hyperbolic space and an indefinite complex projective space do not share a common complex submanifold with induced metrics, answering a question raised in Cheng et al. [ABSTRACT FROM AUTHOR]

In order to reveal the mathematical mechanism of generating grey numbers and the law of grey number evolution, the extension principle of grey set is proposed in this paper firstly, which provides a theoretical basis for grey number operation. Secondly, based on the possibility function of grey set, the concept and properties of grey convex set are given. According to grey convex set, the definitions of grey real number, universal grey real number and interval grey number are put forward. Thirdly, the basic operation rules of grey real number are given based on the extension principle, and the operations of data block expression are further given to meet the reversibility of grey real number operation. Finally, the sufficient and necessary condition for the reversibility of universal grey real number operation is given, and it is proved that the grey real number operations using data block expression are reversible. Examples show that the grey real number operations using data block expression proposed in this paper are feasible and effective. The research results enrich the grey system theory and provide a theoretical basis for grey algebra research. [ABSTRACT FROM AUTHOR]

In this paper, we discuss some extensions of the Maligranda–Orlicz lemma. It deals with the problem of constructing a norm in a subspace of the space of bounded functions, for which it becomes a normed algebra so that the norm introduced is equivalent to the initial norm of the subspace. This is done by satisfying some inequality between these norms. We show in this paper how this inequality is relevant to the study of operator equations in Banach algebras. In fact, we study how to equip a subspace of the space of bounded functions with a norm equivalent to a given one so that it is a normed algebra. We give a general condition for the construction of such norms, which allows us to easily check whether a space with a given norm is an algebra with a pointwise product and the consequences of such a choice for measures of noncompactness in such spaces. We also study quasi-normed spaces. We introduce a general property of measures of noncompactness that allows the study of quadratic operator equations, prove a fixed-point theorem suitable for such problems, and complete the whole with examples and applications. [ABSTRACT FROM AUTHOR]

In the first part of the paper, we propose a different viewpoint on the theory of higher Airy structures (or Airy ideals), which may shed light on its origin. We define Airy ideals in the ħ -adic completion of the Rees Weyl algebra and show that Airy ideals are defined exactly such that they are always related to the canonical left ideal generated by derivatives by automorphisms of the Rees Weyl algebra of a simple type, which we call transvections. The standard existence and uniqueness result in the theory of Airy structures then follow immediately. In the second part of the paper, we construct Airy ideals generated by the nonnegative modes of the strong generators of the principal W -algebra of sp 2 N at level - N - 1 / 2 , following the approach developed in Borot et al. (Mem Am Math Soc, 2021). This provides an example of an Airy ideal in the Heisenberg algebra that requires realizing the zero modes as derivatives instead of variables, which leads to an interesting interpretation for the resulting partition function. [ABSTRACT FROM AUTHOR]

Let G be a locally compact hypergroup and let K be a compact subhypergroup of G. (G,K) is a Gelfand pair if Mc(G//K), the algebra of measures with compact support on the double coset G//K, is commutative for the convolution. In this paper, assuming that (G,K) is a Gelfand pair, we define and study the inverse Fourier transform on G and then establish a Bochner theorem for the pair (G,K). [ABSTRACT FROM AUTHOR]

Bhargava and the first-named author of this paper introduced a functorial Galois closure operation for finite-rank ring extensions, generalizing constructions of Grothendieck and Katz–Mazur. In this paper, we generalize Galois closures and apply them to construct a new infinite family of irreducible components of Hilbert schemes of points. We show that these components are elementary, in the sense that they parametrize algebras supported at a point. Furthermore, we produce secondary families of elementary components obtained from Galois closures by modding out by suitable socle elements. [ABSTRACT FROM AUTHOR]

Consider an infinite-dimentional Banach space denoted as X, and designate ∂(X) as the algebra of all bounded linear operators on X. Moreover, let s (A) denote the spectrum of ..., and ...(A)) indicate the boundary of s (A). A map ... is termed a ρ-spectrum if ... (A) for all A ... In this paper, we characterize all surjective maps f1 and f2 on ρ(X) satisfying ... = (AB) for all A,B(X). [ABSTRACT FROM AUTHOR]

This paper is devoted to defining and studying Whittaker modules and high order Whittaker modules for the N = 1 super-BMS3 algebra. We also classify the simple Whittaker modules and obtain the necessary and sufficient conditions for the irreducibility of these modules. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the necessary and sufficient conditions for solving a dual split quaternion matrix equation A X B   =   C , and present the general solution expression when the solvability conditions are met. As an application, we delve into the necessary and sufficient conditions for the existence of a Hermitian solution to this equation by using a newly defined real representation method. Furthermore, we obtain the solutions for the dual split quaternion matrix equations A X   =   C and X B   =   C . Finally, we provide a numerical example to demonstrate the findings of this paper. [ABSTRACT FROM AUTHOR]

The paper introduces the left and right versions of the large class of Drazin inverses in terms of the left and right annihilators in a ring, which are called left-Drazin and right-Drazin inverses. We characterize some basic properties of these one-sided Drazin inverses, and discuss Jacobson's lemma for them. In addition, the relation between the Drazin inverses and these two one-sided inverses is given by means of the spectrum and the operator decomposition. As an application, the left-Drazin and right-Drazin invertibilities in the Calkin algebra are investigated. [ABSTRACT FROM AUTHOR]

The notion of a transposed Poisson n -Lie algebra has been developed as a natural generalization of a transposed Poisson algebra. It was conjectured that a transposed Poisson n -Lie algebra with a derivation gives rise to a transposed Poisson (n + 1) -Lie algebra. In this paper, we focus on transposed Poisson n -Lie algebras. We have obtained a rich family of identities for these algebras. As an application of these formulas, we provide a construction of (n + 1) -Lie algebras from transposed Poisson n -Lie algebras with derivations under a certain strong condition, and we prove the conjecture in these cases. The notion of a transposed Poisson -Lie algebra has been developed as a natural generalization of a transposed Poisson algebra. It was conjectured that a transposed Poisson -Lie algebra with a derivation gives rise to a transposed Poisson -Lie algebra. In this paper, we focus on transposed Poisson -Lie algebras. We have obtained a rich family of identities for these algebras. As an application of these formulas, we provide a construction of -Lie algebras from transposed Poisson -Lie algebras with derivations under a certain strong condition, and we prove the conjecture in these cases. [ABSTRACT FROM AUTHOR]

Max-plus algebra provides mathematical methods for solving nonlinear problems by using linear equations. These kinds of the problems arise in areas such as manufacturing, transportation, allocation of resources, and information processing technology. In this paper, the scheduling of production systems consisting of many stages and different units is considered, where some of the units can be used for many stages. If a production unit is used for different stages cleaning is needed in between, while no cleaning is needed between stages of the same type. Cleaning of units takes a significant amount of time, which is considered in the scheduling. The goal is to minimize the total production time, and such problems are often solved by using numerical optimization. In this paper a max-plus formalism is used for the modeling and scheduling of such production systems. Structural decisions such as choosing one unit over another proved to be difficult in the latter case, but this can be viewed as a switching max-plus linear system. No switching (and thus no cleaning) is considered as a base case, but for larger production batches the durability constraints will require switches. Switching as seldom as possible is shown to be optimal. Scheduling of a small production system consisting of 6 stages and 6 units is used as a case study. [ABSTRACT FROM AUTHOR]

As is well-known, the subalgebras of any universal algebra form an algebraic closure system. Conversely, every algebraic closure system arises as the family of subalgebras of some universal algebra, but this algebra is far from uniquely determined. This paper investigates the realization of algebraic closure systems by algebras given either by a single operation or by operations of the lowest arity. In particular, it is shown that an algebraic closure system with arity n in which the empty set is closed and every finitely generated closed set is countable can be realized by a single (n + 1) -ary operation. The algebraic closure system of cosets on any group is realized by the single ternary Mal'cev term x y - 1 z . It is shown that the closure system of cosets on an Abelian group A can be realized by a single binary operation if and only if A has at most one element of order 2. Similar results are obtained for modules over an arbitrary ring. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the concept and representations of modified λ-differential Hom-Lie algebras. We then develop the cohomology of modified λ-differential Hom-Lie algebras with coefficients in a suitable representation. As applications, abelian extensions and skeletal modified λ-differential Hom-Lie 2-algebras are characterized in terms of cohomology groups. [ABSTRACT FROM AUTHOR]

In this paper, we introduce the concept of a Quasi B-algebra, building upon the foundational work on Post algebras by G. Epstein and the investigation of semi B-algebras. We systematically explore the properties of Quasi B-algebras, establishing equivalent conditions for the transition from a semi B-algebra to a Quasi B-algebra. [ABSTRACT FROM AUTHOR]

This is a noticeably short biography and introductory paper on multiplier Hopf algebras. It delves into questions regarding the significance of this abstract construction and the motivation behind its creation. It also concerns quantum linear groups, especially the coordinate ring of Mq(n) and the observation that K [Mq(n)] is a quadratic algebra, and can be equipped with a multiplier Hopf ∗-algebra structure in the sense of quantum permutation groups developed byWang and an observation by Rollier–Vaes. In our next paper, we will propose the study of multiplier Hopf graph algebras. The current paper can be viewed as a precursor to this upcoming work, serving as a crucial intermediary bridging the gap between the abstract concept of multiplier Hopf algebras and the well-developed field of graph theory, thereby establishing connections between them! This survey review paper is dedicated to the 78th birthday anniversary of Professor Alfons Van Daele. [ABSTRACT FROM AUTHOR]

Copyright of Proceedings of the Estonian Academy of Sciences is the property of Teaduste Akadeemia Kirjastus and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Let R be a ring of dimension d ≥ 1 containing ℚ and A = R [ X , Y , Z , W ] (X Y − Z W) . This paper examines the question of efficient generation of ideals in A. [ABSTRACT FROM AUTHOR]

Let and ′ be two ∗-Jordan algebras with identities I and I ′ , respectively, and e a nontrivial ∗-idempotent in . In this paper, we study the characterization of multiplicative ∗-Jordan-type maps. In particular, we provide a characterization in the case of unital prime associative algebra endowed with an involution. [ABSTRACT FROM AUTHOR]

Let K be a field and S = K[x1,..., xn] a standard polynomial ring over K. In this paper, we give new combinatorial algorithms to compute the smallest t-spread lexicographic set and the smallest t-spread strongly stable set containing a given set of t-spread monomials of S. Some technical tools allowing to compute the cardinality of t-spread strongly stable sets avoiding their construction are also presented. Such functions are also implemented in a Macaulay2 package, TSpreadIdeals, to ease the computation of well-known results about algebraic invariants for t-spread ideals. [ABSTRACT FROM AUTHOR]

Important connections in representation theory arise from resolving a finite-dimensional algebra by an endomorphism algebra of a generator-cogenerator with finite global dimension; for instance, Auslander's correspondence, classical Schur–Weyl duality and Soergel's Struktursatz. Here, the module category of the resolution and the module category of the algebra being resolved are linked via an exact functor known as the Schur functor. In this paper, we investigate how to measure the quality of the connection between module categories of (projective) Noetherian algebras, B, and module categories of endomorphism algebras of generator-relative cogenerators over B which are split quasi-hereditary Noetherian algebras. In particular, we are interested in finding, if it exists, the highest degree n so that the endomorphism algebra of a generator-cogenerator provides an n-faithful cover, in the sense of Rouquier, of B. The degree n is known as the Hemmer–Nakano dimension of the standard modules. We prove that, in general, the Hemmer–Nakano dimension of standard modules with respect to a Schur functor from a split highest weight category over a field to the module category of a finite-dimensional algebra B is bounded above by the number of non-isomorphic simple modules of B. We establish methods for reducing computations of Hemmer–Nakano dimensions in the integral setup to computations of Hemmer–Nakano dimensions over finite-dimensional algebras, and vice-versa. In addition, we extend the framework to study Hemmer–Nakano dimensions of arbitrary resolving subcategories. In this setup, we find that the relative dominant dimension over (projective) Noetherian algebras is an important tool in the computation of these degrees, extending the previous work of Fang and Koenig. In particular, this theory allows us to derive results for Schur algebras and the BGG category \mathcal {O} in the integral setup from the finite-dimensional case. More precisely, we use the relative dominant dimension of Schur algebras to completely determine the Hemmer–Nakano dimension of standard modules with respect to Schur functors between module categories of Schur algebras over regular Noetherian rings and module categories of group algebras of symmetric groups over regular Noetherian rings. We exhibit several structural properties of deformations of the blocks of the Bernstein-Gelfand-Gelfand category \mathcal {O} establishing an integral version of Soergel's Struktursatz. We show that deformations of the combinatorial Soergel's functor have better homological properties than the classical one. [ABSTRACT FROM AUTHOR]

In a recent paper, the author defined an operation of tensor product for a large class of 2-representations of U + , the positive half of the 2-category associated to sl 2. In this paper, we prove that the operation extends to give an operation of tensor product for 2-representations of the full 2-category U : when the inputs are 2-representations of the full U , the 2-product is also a 2-representation of the full U. As in the previous paper, the 2-product is given for a simple 2-representation L (1) and an abelian 2-representation V taken from the 2-category of algebras. This is the first construction of an operation of tensor product for higher representations of a full Lie algebra in the abelian setting. [ABSTRACT FROM AUTHOR]

In this paper, we make use of the simultaneous decomposition of eight quaternion matrices to study the solvability conditions and general solutions to a system of two-sided coupled Sylvester-type quaternion matrix equations A i X i C i + B i X i + 1 D i = Ω i , i = 1 , 2 , 3 , 4. We design an algorithm to compute the general solution to the system and give a numerical example. Additionally, we consider the application of the system in the encryption and decryption of color images. [ABSTRACT FROM AUTHOR]

Let A be a unital A-algebra containing a non-trivial projection. In this paper, we prove that if a map Ω: A → A such that Ω([K, F]A ⊙ D) = [Ω(K), F]A ⊙ D + [K, Ω(F)]A ⊙ D + [K, F]A ⊙ Ω(D), where [K, F]A = KF - FKA and K ⊙ F = KAF + FKA for all K, F, D ∈ A, then Ω is an additive A-derivation. Furthermore, we extend its results on factor von Neumann algebras, standard operator algebras and prime A-algebras. Additionally, we provide an example illustrating the existence of such maps. [ABSTRACT FROM AUTHOR]

This paper discusses the problem of marking constraints in a class of partially controllable timed Petri nets. Specifically, these are Timed Event Graphs (TEGs) which include disturbed input transitions and which are subject to token capacity constraints in some paths. Using the Min-Plus algebra formalism, formal approaches are proposed to design causal control laws to guarantee compliance with marking constraints in TEGs. Sufficient conditions are defined to show the existence and synthesis of these controllers. The developed methodologies are illustrated in a case study of a disassembly system with a limited stock of components. [ABSTRACT FROM AUTHOR]

The goal of the present paper is to provide a cohomology theory and crossed modules of modified Rota–Baxter pre-Lie algebras. We introduce the notion of a modified Rota–Baxter pre-Lie algebra and its bimodule. We define a cohomology of modified Rota–Baxter pre-Lie algebras with coefficients in a suitable bimodule. Furthermore, we study the infinitesimal deformations and abelian extensions of modified Rota–Baxter pre-Lie algebras and relate them with the second cohomology groups. Finally, we investigate skeletal and strict modified Rota–Baxter pre-Lie 2-algebras. We show that skeletal modified Rota–Baxter pre-Lie 2-algebras can be classified into the third cohomology group, and strict modified Rota–Baxter pre-Lie 2-algebras are equivalent to the crossed modules of modified Rota–Baxter pre-Lie algebras. [ABSTRACT FROM AUTHOR]