Search

In the present paper, necessary and sufficient conditions are given for the equality of the power rezidue symbols $$ {\left( {\frac{\alpha }{a}} \right)_n} $$ and $$ {\left( {\frac{\alpha }{a}} \right)_n} $$ in the cyclotomic field ℚ(ζ n), 2 ∤ n, for a ∈ ℤ, ( a, n) = 1. This result is a generalization of the classical Eisenstein reciprocity law and its continuation in a Hasse’s paper. Bibliography: 3 titles. [ABSTRACT FROM AUTHOR]

We fill a gap in the proof of one of the central theorems in Epp’s paper, concerning p-cyclic extensions of complete discrete valuation rings. [ABSTRACT FROM AUTHOR]

The article announces the selection of the study "Decomposition Algorithms for Stochastic Programming on a Computational Grid," written by Jeff Linderoth and Stephen Wright by the editorial board of the periodical "Computational Optimization and Applications," for the Best Paper Award 2004. The paper describes research carried out by the authors at the Argonne National Laboratory which was supported by the National Science Foundation (NSF). The research involved the development of middleware software, the discovery of new algorithms that could exploit the power of grid platforms while not being affected too seriously by its less felicitous features and the implementation of these algorithms using the resulting codes to solve touchstone problems in optimization.

In the last decade, the Poincaré conjecture has probably been the most famous statement among all the contributions of Poincaré to the mathematics community. There have been many papers and books that describe various attempts and the final works of Perelman leading to a positive solution to the conjecture, but the evolution of Poincaré's works leading to this conjecture has not been carefully discussed or described, and some other historical aspects about it have not been addressed either. For example, one question is how it fits into the overall work of Poincaré in topology, and what are some other related questions that he had raised. Since Poincaré did not state the Poincaré conjecture as a conjecture but rather raised it as a question, one natural question is why he did this. In order to address these issues, in this paper, we examine Poincaré's works in topology in the framework of classifying manifolds through numerical and algebraic invariants. Consequently, we also provide a full history of the formulation of the Poincaré conjecture which is richer than what is usually described and accepted and hence gain a better understanding of overall works of Poincaré in topology. In addition, this analysis clarifies a puzzling question on the relation between Poincaré's stated motivations for topology and the Poincaré conjecture. [ABSTRACT FROM AUTHOR]

Abstract  This paper addresses the dialectical relation between theoretical thinking and technique, as they co-emerge in a combined computer algebra (CAS) and paper-and-pencil environment. The theoretical framework in this ongoing study consists of the instrumental approach to tool use and an adaptation of Chevallard’s anthropological theory. The main aim is to unravel the subtle intertwining of students’ theoretical thinking and the techniques they use in both media, within the process of instrumental genesis. Two grade 10 teaching experiments are described, the first one on equivalence, equality and equation, and the second one on generalizing and proving within factoring. Even though the two topics are quite different, findings indicate the importance of the co-emergence of theory and technique in both cases. Some further extensions of the theoretical framework are suggested, focusing on the relation between paper-and-pencil techniques and computer algebra techniques, and on the issue of language and discourse in the learning process. [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]

As a quantum affinization, the quantum toroidal algebra U q , q ¯ (gl ¨ n) is defined in terms of its "left" and "right" halves, which both admit shuffle algebra presentations (Enriquez in Transform Groups 5(2):111–120, 2000; Feigin and Odesskii in Am Math Soc Transl Ser 2:185, 1998). In the present paper, we take an orthogonal viewpoint, and give shuffle algebra presentations for the "top" and "bottom" halves instead, starting from the evaluation representation U q (gl ˙ n) ↷ C n (z) and its usual R-matrix R (z) ∈ End (C n ⊗ C n) (z) (see Faddeev et al. in Leningrad Math J 1:193–226, 1990). An upshot of this construction is a new topological coproduct on U q , q ¯ (gl ¨ n) which extends the Drinfeld–Jimbo coproduct on the horizontal subalgebra U q (gl ˙ n) ⊂ U q , q ¯ (gl ¨ n) . [ABSTRACT FROM AUTHOR]

In this paper, we construct a symbol calculus yielding short exact sequences for the dual Toeplitz algebra generated by all bounded dual Toeplitz operators on the Hardy space associated with the polydisk D n in the unitary space C n , that have been introduced and well studied in our earlier paper (Benaissa and Guediri in Taiwan J Math 19: 31–49, 2015), as well as for the C*-subalgebra generated by dual Toeplitz operators with symbols continuous on the associated hypertorus T n . [ABSTRACT FROM AUTHOR]

. [ABSTRACT FROM AUTHOR]

In this paper, we consider a constructive proof of the termination of the normal form (NF) algorithm for multivariate polynomials, as well as the related concept of admissible ordering < on monomials. In classical mathematics, the well-quasiorder property of relation < is derived from Dickson's lemma, and this is sufficient to justify the termination of the NF algorithm. In provable programming based on constructive type theory (Coq and Agda), a somewhat stronger condition (in constructive mathematics) of the well-foundedness of the ordering (in its constructive version) is required. We propose a constructive proof of this theorem (T) for < , which is based on a known method that we refer to here as the "pattern method." This theorem on the well-foundedness of an arbitrary admissible ordering is also important in itself, independently of the NF algorithm. We are not aware of any other works on constructive proof of this theorem. However, it turns out that it follows, not very difficultly, from the results achieved by other researchers in 2003. We program this proof in the Agda language in the form of our library AdmissiblePPO-wellFounded of provable computational algebra programs. This development also uses the theorem to prove termination of the NF algorithm for polynomials. Thus, the library also contains a set of provable programs for polynomial algebra, which is significantly larger than that needed to prove Theorem T. [ABSTRACT FROM AUTHOR]

In this paper, we turn to the notion of networking theories with the aim of contrasting two theoretical mathematics education perspectives inspired by Vygotsky's work, namely, the Theory of Objectification and the Documentational Approach to Didactics. We are interested in comparing/contrasting these theories in accordance with the following three main questions: (a) the role that the theories ascribe to language and resources; (b) the conceptions that the theories bring forward concerning the teacher, and (c) the understandings they offer of the mathematics classroom. In the first part of the paper, some basic concepts of each perspective are presented. The second part includes some episodes from a lesson on the teaching and learning of algebra in a Grade 1 class (6–7-year-old students). The episodes serve as background to carry out, in the third part of the paper, a dialogue between proponents of the theoretical perspectives around the identified main questions. The dialogue shows some theoretical complementarities and differences and reveals, in particular, different conceptions of the teacher and the limits and possibilities that language affords in teaching–learning mathematics. [ABSTRACT FROM AUTHOR]

In this paper we consider implications of the current world-wide inclusion of computational thinking in relation to children's development of algebraic thinking. Little is known about how newly developed visual programming environments such as Scratch could enhance early algebra learning. The study is based on examples of programming activities used by mathematics teachers in Sweden, teaching students aged 10–12 years during the first two years of implementing programming in the mathematics curriculum. Informed by Chevallard's praxeology in terms of praxis and logos, we describe, unpack, discuss and expand these activities. Core issues related to algebra found in the three activities are as follows: making implicit variables explicit; using a counter variable; and identifying parameters as a specific type of variable. Our findings show that, in addition to already identified uses of variables in early algebra, programming activities in the early years bring in new aspects and new ways of treating variables that could, potentially, enhance students' understanding of variables and generalization, provided that programming praxis is embedded in an appropriate algebra logos. [ABSTRACT FROM AUTHOR]

This paper develops an improved tri-coloured rooted-tree theory for the order conditions for ERKN methods solving general multi-frequency and multidimensional second-order oscillatory systems. The bottleneck of the original tricoloured rooted-tree theory is the existence of numerous redundant trees. In light of the fact that the sum of the products of the symmetries and the elementary differentials is meaningful, this paper naturally introduces the so-called extended elementary differential mappings. Then, the new improved tri-coloured rooted tree theory is established based on a subset of the original tri-coloured rooted-tree set. This new theory makes all redundant trees disappear, and thus, the order conditions of ERKN methods for general multi-frequency and multidimensional second-order oscillatory systems are reduced greatly. Furthermore, with this new theory, we present some new ERKN methods of order up to four. Numerical experiments are implemented and the results show that ERKN methods can be competitive with other existing methods in the scientific literature, especially when comparatively large stepsizes are used. [ABSTRACT FROM AUTHOR]

This paper focuses on the emergence of abstraction through the use of a new kind of motion detector—WiiGraph—with 11-year-old children. In the selected episodes, the children used this motion detector to create three simultaneous graphs of position vs. time: two graphs for the motion of each hand and a third one corresponding to their difference. They explored relationships that can be ascribed to an equation of the type A – B = C. We examine the notion of abstraction on its own, without assuming a dualism abstract-concrete according to which more of one is less of the other. We propose a distinct path for the attainment of abstraction, which involves navigating a surplus of sensible qualities. The work described in this paper belongs to early algebra, we suggest, because it involves the elementary symbolic treatment of unknowns and generals. More broadly, it advances a perspective on the nature of mathematical abstraction. [ABSTRACT FROM AUTHOR]

In the paper (J Math Soc Jpn 72(1):303–331, 2020), Tse-Chung Yang and the first two current authors computed explicitly the number | SSp 2 (F q) | of isomorphism classes of superspecial abelian surfaces over an arbitrary finite field F q of even degree over the prime field F p . There it was assumed that certain commutative Z p -orders satisfy an étale condition that excludes the primes p = 2 , 3 , 5 . We treat these remaining primes in the present paper, where the computations are more involved because of the ramification. This completes the calculation of | SSp 2 (F q) | in the even degree case. The odd degree case was previous treated by Tse-Chung Yang and the first two current authors in (Doc Math 21:1607–1643, 2016). To complete the proof of our main theorem, we give a classification of lattices over local quaternion Bass orders, which is a new input to our previous works. [ABSTRACT FROM AUTHOR]

In this paper, the authors consider the range of a certain class of ASH algebras in [An, Q., Elliott, G. A., Li, Z. and Liu, Z., The classification of certain ASH C*-algebras of real rank zero, J. Topol. Anal., 14(1), 2022, 183–202], which is under the scheme of the Elliott program in the setting of real rank zero C*-algebras. As a reduction theorem, they prove that all these ASH algebras are still the AD algebras studied in [Dadarlat, M. and Loring, T. A., Classifying C*-algebras via ordered, mod-p K-theory, Math. Ann., 305, 1996, 601–616]. [ABSTRACT FROM AUTHOR]

Self-efficacy in mathematics is related to engagement, persistence, and academic performance. Prior research focused mostly on examining changes to students' self-efficacy across large time intervals (months or years), and paid less attention to changes at the level of lesson sequences. Knowledge of how self-efficacy changes during a sequence of lessons is important as it can help teachers better support students' self-efficacy in their everyday work. In this paper, we expanded previous studies by investigating changes in students' self-efficacy across a sequence of 3–4 lessons when students were learning a new topic in mathematics (nStudents = 170, nTime-points = 596). Nine classes of Norwegian grade 6 (n = 77) and grade 10 students (n = 93) reported their self-efficacy for easy, medium difficulty, and hard tasks. Using multilevel models for change, we found (a) change of students' self-efficacy across lesson sequences, (b) differences in the starting point and change of students' self-efficacy according to perceived task difficulty and grade, (c) more individual variation of self-efficacy starting point and change in association with harder tasks, and (d) students in classes who were taught a new topic in geometry had stronger self-efficacy at the beginning of the first lesson as compared to those who were taught a new topic in algebra (grade 10), and students in classes who were taught a new topic in fractions had steeper growth across the lesson sequence as compared to those who were taught a new topic in measurement (grade 6). Implications for both research and practice on how new mathematics topics are introduced to students are discussed. [ABSTRACT FROM AUTHOR]

In this paper, we employ the well-known Krasnoselskii fixed point theorem to study the existence and n-multiplicity of positive periodic solutions for the periodic impulsive functional differential equations with two parameters. The form including an impulsive term of the equations in this paper is rather general and incorporates as special cases various problems which have been studied extensively in the literature. Easily verifiable sufficient criteria are obtained for the existence and n-multiplicity of positive periodic solutions of the impulsive functional differential equations. [ABSTRACT FROM AUTHOR]

Problems are often too complex to solve them in an optimal way. The complexity arises from connections between their elements, such that a change in one element influences the performance of other elements. Kauffman’s NK model offers a way to depict such interdependencies and has therefore often been used in economic investigations of the influence of problem or search decomposition on the attainable results. However, papers on the effect of different decompositions on solution quality come to contradictory conclusions. Some observe an initial advantage of over-modularization where others do not. As they also differ in the employed search procedures, but do not base them on empirical findings, the present paper examines the results of more empirically based search strategies. Using algorithms based on innovation strategies derived from patent data, the paper establishes a clear advantage of correct problem decompositions. [ABSTRACT FROM AUTHOR]

The present paper continues a cycle of papers, in which the Yoneda algebras were calculated for several families of algebras of dihedral and semidihedral type in the classification by K. Erdmann. Using the technique of a previous paper, a description of the Yoneda algebras for both families of local algebras occurring in this classification is given. Namely, a conjecture about the structure of the minimal free resolution of a (unique) simple module is stated, which is based on some empirical observations, and after establishing this conjecture, “cohomology information" is derived from the resolution discovered, and, as a result, this allows us to describe the Yoneda algebras of the algebras under consideration, It is noted that a similar technique was applied in computation of the Hochschild cohomology algebra for some finite-dimensional algebras. Bibliography: 23 titles. [ABSTRACT FROM AUTHOR]

In this paper, finite element methods for the problems of wave propagation in a fluid-saturated porous medium are discussed. The medium is composed of a porous elastic solid (soil, rock, etc.) saturated by a compressible viscous fluid (oil, water, etc.), and the fluid may flow relatively to the solid. Biot's lowfrequency dynamic equations are chosen to describe the problems mentioned above, with stress-given boundary conditions, ABGs (Absorbing Boundary Conditions) on artificial boundaries and conditions on interfaces between the fluid-saturated porous medium and elastic solids. In the paper, a new kind of discrete ABCs is presented, and a discrete-time Galerkin method are utilized for obtaining approximate solutions. The numerical results show that they both are effective. Two dilatational waves (fast wave P1 and slow wave P2) and one rotational wave (S wave) are clearly visible in the figures of computational results, which coincide with theoretical analysis very well. [ABSTRACT FROM AUTHOR]

This paper introduces Fourier-approximated Lie algebras for shooting (FLASH), a fast geodesic shooting algorithm for diffeomorphic image registration. We approximate the infinite-dimensional Lie algebra of smooth vector fields, i.e., the tangent space at the identity of the diffeomorphism group, with a low-dimensional, bandlimited space. We show that most of the computations for geodesic shooting can be carried out entirely in this low-dimensional space. Our algorithm results in dramatic savings in time and memory over traditional large-deformation diffeomorphic metric mapping algorithms, which require dense spatial discretizations of vector fields. To validate the effectiveness of FLASH, we run pairwise image registration on both 2D synthetic data and real 3D brain images and compare with the state-of-the-art geodesic shooting methods. Experimental results show that our algorithm dramatically reduces the computational cost and memory footprint of diffemorphic image registration with little or no loss of accuracy. [ABSTRACT FROM AUTHOR]

The paper continues the series of papers devoted to surveying and developing methods for solving problems for two-parameter polynomial and rational matrices. Different types of factorizations of two-parameter rational matrices (including irreducible and minimal ones), methods for computing them, and their applications to solving spectral problems are considered. Bibliography: 6 titles. [ABSTRACT FROM AUTHOR]

In this paper we are interested in the global existence and large time behavior of solutions to the initial- boundary value problem for sub critical nonlinear dissipative equations (Multiple line equation(s) cannot be represented in ASCII text) where the nonlinear term N(u, ux) depends on the unknown function u and its derivative ux and satisfy the estimate (Multiple line equation(s) cannot be represented in ASCII text)The linear operator IK(u) is defined as follows (Multiple line equation(s) cannot be represented in ASCII text) where the constants an, am ϵ R, n, m are integers, m > n. The aim of this paper is to prove the global existence of solutions to the initial-boundary value Problem (1). We find the main term of the asymptotic representation of solutions in sub critical case, when the nonlinear term of equation has the time decay rate less then that of the linear terms. Also we give some general approach to obtain global existence of solution of initial-boundary value problem in sub critical case and elaborate general sufficient conditions to obtain asymptotic expansion of solution. [ABSTRACT FROM AUTHOR]

The theory of nonnegative matrices is an example of a theory motivated in its origins and development by purely mathematical concerns that later proved to have a remarkably broad spectrum of applications to such diverse fields as probability theory, numerical analysis, economics, dynamical programming, and demography. At the heart of the theory is what is usually known as the Perron–Frobenius Theorem. It was inspired by a theorem of Oskar Perron on positive matrices, usually called Perron’s Theorem. This paper is primarily concerned with the origins of Perron’s Theorem in his masterful work on ordinary and generalized continued fractions (1907) and its role in inspiring the remarkable work of Frobenius on nonnegative matrices (1912) that produced, inter alia, the Perron–Frobenius Theorem. The paper is not at all intended exclusively for readers with expertise in the theory of nonnegative matrices. Anyone with a basic grounding in linear algebra should be able to read this article and come away with a good understanding of the Perron–Frobenius Theorem as well as its historical origins. The final section of the paper considers the first major application of the Perron–Frobenius Theorem, namely, to the theory of Markov chains. When he introduced the eponymous chains in 1908, Markov adumbrated several key notions and results of the Perron–Frobenius theory albeit within the much simpler context of stochastic matrices; but it was by means of Frobenius’ 1912 paper that the linear algebraic foundations of Markov’s theory for nonpositive stochastic matrices were first established by R. Von Mises and V.I. Romanovsky. [ABSTRACT FROM AUTHOR]

Abstract  The aim of this paper and its sequel is to introduce and classify the holonomy algebras of the projective Tractor connection. After a brief historical background, this paper presents and analyses the projective Cartan and Tractor connections, the various structures they can preserve, and their geometric interpretations. Preserved subbundles of the Tractor bundle generate foliations with Ricci-flat leaves. Contact- and Einstein-structures arise from other reductions of the Tractor holonomy, as do U(1) and $$Sp(1, \mathbb{H})$$ bundles over a manifold of smaller dimension. [ABSTRACT FROM AUTHOR]

In this paper, we consider a Cauchy problem for an elliptic equation in a plane domain. The problem is ill-posed. Using the method of quasi-reversibility, an approximation to the exact solution is given. Using Carleman's inequatily, we derive a sharp error estimate. [ABSTRACT FROM AUTHOR]

Traces of inverse powers of a positive definite symmetric tridiagonal matrix give lower bounds of the minimal singular value of an upper bidiagonal matrix. In a preceding work, a formula for the traces which gives the diagonal entries of the inverse powers is presented. In this paper, we present another formula which gives the traces based on a quite different idea from the one in the preceding work. An efficient implementation of the formula for practice is also presented. [ABSTRACT FROM AUTHOR]

In this paper, an elliptic optimization problem with pointwise inequality constraints on the state is considered. The main contributions of this paper are a priori $$L^2$$ -error estimates for the discretization error in the optimal states. Due to the non separability of the space for the Lagrange multipliers for the inequality constraints, the problem is tackled by separation of the discretization error into two components. First, the state constraints are discretized. Second, with discretized inequality constraints, a duality argument for the error due to the discretization of the PDE is employed. For the second stage an a priori error estimate is derived with constants depending on the regularity of the dual problem. Finally, we discuss two cases in which these constants can be bounded in a favorable way; leading to higher order estimates than those induced by the known $$L^2$$ -error in the control variable. More precisely, we consider a given fixed number of pointwise inequality constraints and a case of infinitely many but only weakly active constraints. [ABSTRACT FROM AUTHOR]

In this paper, we perform $$L^\infty $$ and $$W^{1,\infty }$$ error estimates for a class of bi- k finite volume schemes on a quadrilateral mesh for elliptic equations, where $$k\ge 2$$ is arbitrary. We show that the errors of the finite volume solution in both the $$L^\infty $$ and $$W^{1,\infty }$$ norms converge to zero with optimal orders, provided the solution $$u\in W^{k+2,\infty }$$ . Our analysis is based mainly on an estimate of the difference between the finite volume and the corresponding finite element bilinear forms, as well as some techniques derived for $$L^\infty $$ and $$W^{1,\infty }$$ estimates of the finite element method. Our theoretical findings are supported by several numerical examples. [ABSTRACT FROM AUTHOR]

In this paper, we give an affirmative answer to two conjectures on generalized (m, n)-Jordan derivations and generalized (m, n)-Jordan centralizers raised in Ali and Fošner (Algebra Colloq 21:411–420, 2014) and Fošner (Demonstr Math 46:254–262, 2013). Precisely, when R is a semiprime ring, we prove, under some suitable torsion restrictions, that every nonzero generalized (m, n)-Jordan derivation (resp., a generalized (m, n)-Jordan centralizer) is a derivation (resp., a two-sided centralizer). [ABSTRACT FROM AUTHOR]

Hecke conjectured that an explicit set of theta series obtained from a quaternion algebra defined over ℚ ramified at a prime N is a basis of a space of holomorphicmodular forms of weight 2 for the Hecke congruence group Γ0(N). However, Eichler noticed that Hecke's conjecture is not true in general. Hence it is natural to ask the dimension of the subspace of M2(Γ0(N)) spanned by the theta series, and this question is called Hecke's basis problem, which we have shown an answer in [K. Sugiyama, On the space of theta functions for a prime level, Comment. Math. Univ. St. Pauli, 67(1):66–81, 2019]. In this paper, we generalize the results for a square-free positive integer N. [ABSTRACT FROM AUTHOR]

It was shown by Fock and Goncharov (Dual Teichmüller and lamination spaces. Handbook of Teichmüller Theory, 2007), and Fomin et al. (Acta Math 201(1):83–146, 2008) that some cluster algebras arise from triangulated orientable surfaces. Subsequently, Dupont and Palesi (J Algebraic Combinatorics 42(2):429–472, 2015) generalised this construction to include unpunctured non-orientable surfaces, giving birth to quasi-cluster algebras. In Wilson (Int Math Res Notices 341, 2017) we linked this framework to Lam and Pylyavskyy's Laurent phenomenon algebras (J Math 4(1):121–162, 2016), showing that unpunctured surfaces admit an LP structure. In this paper we extend quasi-cluster algebras to include punctured surfaces. Moreover, by adding laminations to the surface we demonstrate that all punctured and unpunctured surfaces admit LP structures. In short, we link two constructions which arose as seemingly unrelated generalisations of cluster algebras—one of the generalisations (quasi-cluster algebras) being based on triangulated surfaces, and the other (Laurent phenomenon algebras) based on the Laurent phenomenon. We thus provide a rich class of geometric examples in which to help study Laurent phenomenon algebras. [ABSTRACT FROM AUTHOR]

In this paper, we first present a family of iterative algorithms for simultaneous determination of all zeros of a polynomial. This family contains two well-known algorithms: Dochev-Byrnev's method and Ehrlich's method. Second, using Proinov's approach to studying convergence of iterative methods for polynomial zeros, we provide a semilocal convergence theorem that unifies the results of Proinov (Appl. Math. Comput. 284: 102-114, 2016) for Dochev-Byrnev's and Ehrlich's methods. [ABSTRACT FROM AUTHOR]

The variation theory of learning emphasizes variation as a necessary condition for learners to be able to discern new aspects of an object of learning. In a substantial number of studies, the theory has been used to analyze teaching and students' learning in classrooms. In mathematics education, variation theory has also been used to explore variation in sets of instructional examples. For example, it has been reported how teachers, by using variation and invariance within and between examples, can help learners to engage with mathematical structure. In this paper, we describe the variation theory of learning, its underlying principles, and how it might be appropriated by teachers. We illustrate this by an analysis of one teacher's teaching before and after he participated in three lesson studies based on variation theory. Both the theory and the empirical illustration focus on 'what is made possible to learn' in different learning situations. We show that in the two analyzed lessons, different things were made possible to learn. [ABSTRACT FROM AUTHOR]

In this paper, we present a novel approach to the construction of new finite algebras and describe the congruence lattices of these algebras. Given a finite algebra $${\langle B_0, \ldots \rangle}$$, let $${B_1,B_2, \ldots , B_K}$$ be sets that either intersect B or intersect each other at certain points. We construct an overalgebra $${\langle A, FA \rangle}$$, by which we mean an expansion of $${\langle B_0, \ldots \rangle}$$ with universe $${A = B_0 \cup B_1 \cup \ldots \cup B_K}$$, and a certain set F of unary operations that includes mappings e satisfying $${e^2_i = e_i}$$ and e( A) = B, for $${0 \leq i \leq K}$$. We explore two such constructions and prove results about the shape of the new congruence lattices Con $${\langle A, F_A \rangle}$$ that result. Thus, descriptions of some new classes of finitely representable lattices is one contribution of this paper. Another, perhaps more significant, contribution is the announcement of a novel approach to the discovery of new classes of representable lattices, the full potential of which we have only begun to explore. [ABSTRACT FROM AUTHOR]

The first half of this paper is the written version of the invited talk presented at Unconventional Computing UC10, The University of Tokyo, Japan, June 21-25, 2010. It describes some salient features of hypercomputation in Dickson algebras. Such quadratic algebras form an appropriate framework for nonlinear computations which does not limit a priori the computational power of multiplication. They underlie paradoxical mathematics whose potential interest to analyse some computational aspects of the human mind which resist the classical approach is presented. In its last part, the paper offers new glimpses on the organic logic for hypercomputation by developing a fresh look at plane geometry in relation with the ζ function. [ABSTRACT FROM AUTHOR]

Structured matrices are encountered in various guises in many mathematical models which describe problems of the real world. In fact, they are the algebraic translation of the specific properties at the basis of the physical problem. The analysis and the exploitation of matrix structures is the first fundamental step in the design of highly efficient algorithms for the solution of complex computational problems. [ABSTRACT FROM AUTHOR]

This paper gives a generalization of group theory, i.e. a unification theory of different causal algebras, and its applications to theoretical physics. We propose left and right causal algebras, left and right causal decomposition algebras, causal algebra and causal decomposition algebras in terms of quantitative causal principle. The causal algebraic system of containing left (or right) identity I (or I) is called as the left (or right) causal algebra, and associative law is deduced. Furthermore the applications of the new algebraic systems are given in theoretical physics, specially in the reactions of containing supersymmetric particles, we generally obtain the invariance of supersymmetric parity of multiplying property. In the reactions of particles of high energy, there may be no identity, but there are special inverse elements, which make that the relative algebra be not group, however, the causal algebra given in this paper is just a tool of severely and directly describing the real reactions of particle physics. And it is deduced that the causal decomposition algebra is equivalent to group. [ABSTRACT FROM AUTHOR]

In this paper, we prove the Hyers-Ulam-Rassias stability of isometric homomorphisms in proper CQ*-algebras for the following Cauchy-Jensen additive mapping: The concept of Hyers-Ulam-Rassias stability originated from the Th.M. Rassias’ stability theorem that appeared in the paper: On the stability of the linear mapping in Banach spaces, Proc. Amer. Math. Soc., 72 (1978), 297–300. This is applied to investigate isometric isomorphisms between proper CQ*-algebras. [ABSTRACT FROM AUTHOR]

Several investigations in probability theory and the theory of expert systems show that it is important to search for some reasonable generalizations of fuzzy logics (e.g. Łukasiewicz, Gödel or product logic) having a non-associative conjunction. In the present paper, we offer a non-associative fuzzy logic L CBA having as an equivalent algebraic semantics lattices with section antitone involutions satisfying the contraposition law, so-called commutative basic algebras. The class (variety) CBA of commutative basic algebras was intensively studied in several recent papers and includes the class of MV-algebras. We show that the logic L CBA is very close to the Łukasiewicz one, both having the same finite models, and can be understood as its non-associative generalization. [ABSTRACT FROM AUTHOR]

It was shown that N=1 super-symmetry algebra can be constructed in de Sitter space (Pahlavan et al. in Phys Lett. B 627:217–223, ), through calculation of charge conjugation in the ambient space notation (Moradi et al. in Phys. Lett. B 613:74, ; Phys. Lett. B 658:284, ). Calculation of N=2 super-symmetry algebra constitutes the main frame of this paper. N=2 super-symmetry algebra was presented in Pilch et al. (Commun. Math. Phys. 98:105, ). In this paper, we obtain an alternative N=2 super-symmetry algebra. [ABSTRACT FROM AUTHOR]

This paper deals with a parametric family of convex semi-infinite optimization problems for which linear perturbations of the objective function and continuous perturbations of the right-hand side of the constraint system are allowed. In this context, Cánovas et al. (SIAM J. Optim. 18:717–732, []) introduced a sufficient condition (called ENC in the present paper) for the strong Lipschitz stability of the optimal set mapping. Now, we show that ENC also entails high stability for the minimal subsets of indices involved in the KKT conditions, yielding a nice behavior not only for the optimal set mapping, but also for its inverse. Roughly speaking, points near optimal solutions are optimal for proximal parameters. In particular, this fact leads us to a remarkable simplification of a certain expression for the (metric) regularity modulus given in Cánovas et al. (J. Glob. Optim. 41:1–13, []) (and based on Ioffe (Usp. Mat. Nauk 55(3):103–162, []; Control Cybern. 32:543–554, [])), which provides a key step in further research oriented to find more computable expressions of this regularity modulus. [ABSTRACT FROM AUTHOR]

Abstract  This paper is a sequel to the studies on classification properties of involutive divisions reported in [1]. An example is given in which the minimal involutive basis of a particular monomial ideal for the “Janet antipode” n! orderings of variables. This example disproves the hypothesis that the minimal involutive basis for continuous and constructive divisions always coincides with the Janet basis for some ordering of variables. [ABSTRACT FROM AUTHOR]

In the paper we focus on self-adjoint noncommutative martingales. We provide an extension of the notion of differential subordination, which is due to Burkholder in the commutative case. Then we show that there is a noncommutative analogue of the Burkholder method of proving martingale inequalities, which allows us to establish the weak type (1,1) inequality for differentially subordinated martingales. Moreover, a related sharp maximal weak type (1,1) inequality is proved. [ABSTRACT FROM AUTHOR]

This paper continues the study of orthonormal bases (ONB) of L 2 [ 0 , 1 ] introduced in Dutkay et al. (J. Math. Anal. Appl. 409(2):1128–1139, 2014) by means of Cuntz algebra O N representations on L 2 [ 0 , 1 ] . For N = 2 , one obtains the classic Walsh system. We show that the ONB property holds precisely because the O N representations are irreducible. We prove an uncertainty principle related to these bases. As an application to discrete signal processing we find a fast generalized transform and compare this generalized transform with the classic one with respect to compression and sparse signal recovery. [ABSTRACT FROM AUTHOR]

This paper considers the Steiner Minimal Tree (SMT) problem in the rectilinear and octilinear planes. The study is motivated by the physical design of VLSI: The rectilinear case corresponds to the currently used M-architecture, which uses either horizontal or vertical routing, while the octilinear case corresponds to a new routing technique, X-architecture, that is based on the pervasive use of diagonal directions. The experimental studies show that the X-architecture demonstrates a length reduction of more than 10–20%. In this paper, we make a theoretical study on the lengths of SMTs in these two planes. Our mathematical analysis confirms that the length reduction is significant as the previous experimental studies claimed, but the reduction for three points is not as significant as for two points. We also obtain the lower and upper bounds on the expected lengths of SMTs in these two planes for arbitrary number of points. [ABSTRACT FROM AUTHOR]

Abstract?? In this paper, we discuss distance measures for a number of different combinatorial optimization problems of which the solutions are best represented as permutations of items, sometimes composed of several permutation (sub)sets. The problems discussed include single-machine and multiple-machine scheduling problems, the traveling salesman problem, vehicle routing problems, and many others. Each of these problems requires a different distance measure that takes the specific properties of the representation into account. The distance measures discussed in this paper are based on a general distance measure for string comparison called the edit distance. We introduce several extensions to the simple edit distance, that can be used when a solution cannot be represented as a simple permutation, and develop algorithms to calculate them efficiently. [ABSTRACT FROM AUTHOR]