Search

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]

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]

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]

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]

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]

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]

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]

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]

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 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]

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 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]

Let R be a ring, M be a R-bimodule and m, n be two fixed nonnegative integers with m + n ≠ 0. An additive mapping δ from R into M is called an (m, n)-Jordan derivation if (m + n)δ(A2) = 2mAδ(A) + 2nδ(A)A for every A in R. In this paper, we prove that every (m, n)-Jordan derivation with m ≠ n from a C* -algebra into its Banach bimodule is zero. An additive mapping δ from R into M is called a (m, n)-Jordan derivable mapping at W in R if (m + n)δ(AB + BA) = 2mδ(A)B + 2mδ(B)A + 2nAδ(B) + 2nBδ(A) for each A and B in R with AB = BA = W. We prove that if M is a unital A-bimodule with a left (right) separating set generated algebraically by all idempotents in A, then every (m, n)-Jordan derivable mapping at zero from A into M is identical with zero. We also show that if A and B are two unital algebras, M is a faithful unital (A, B)-bimodule and U=[AMNB] is a generalized matrix algebra, then every (m, n)-Jordan derivable mapping at zero from U into itself is equal to zero. [ABSTRACT FROM AUTHOR]

This paper resolves the unicity conjecture of Bonahon and Wong for the Kauffman bracket skein algebras of all oriented finite type surfaces at all roots of unity. The proof is a consequence of a general unicity theorem that says that the irreducible representations of a prime affine k-algebra over an algebraically closed field k, that is finitely generated as a module over its center, are generically classified by their central characters. The center of the Kauffman bracket skein algebra of any orientable surface at any root of unity is characterized, and it is proved that the skein algebra is finitely generated as a module over its center. It is shown that for any orientable surface the center of the skein algebra at any root of unity is the coordinate ring of an affine algebraic variety. [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]

In this paper, we consider polytopes P that are contained in the unit hypercube. We provide conditions on the set of 0, 1 vectors not contained in P that guarantee that P has a small Chvátal rank. Our conditions are in terms of the subgraph induced by these infeasible 0, 1 vertices in the skeleton graph of the unit hypercube. In particular, we show that when this subgraph contains no 4-cycle, the Chvátal rank is at most 3; and when it has tree width 2, the Chvátal rank is at most 4. We also give polyhedral decomposition theorems when this graph has a vertex cutset of size one or two. [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]

The notion of coupled fixed point was introduced in 2006 by Bhaskar and Lakshmikantham. On the other hand, Filipovićet al. [M. Filipovićet al., 'Remarks on 'Cone metric spaces and fixed-point theorems of T-Kannan and T-Chatterjea contractive mappings',' Math. Comput. Modelling 54, 1467-1472 (2011)] proved several fixed and periodic point theorems for solid cones on cone metric spaces. In this paper we prove some coupled fixed-point theorems for certain T-contractions and study the existence of solutions of a system of nonlinear integral equations using the results of our work. The results of this paper extend and generalize well-known comparable results in the literature. [ABSTRACT FROM AUTHOR]

A one-sided limit order book is modeled as a noncooperative game for several players. Agents offer various quantities of an asset at different prices, competing to fulfill an incoming order, whose size is not known a priori. Players can have different payoff functions, reflecting different beliefs about the fundamental value of the asset and probability distribution of the random incoming order. In a previous paper, the existence of a Nash equilibrium was established by means of a fixed point argument. The main issue discussed in the present paper is whether this equilibrium can be obtained from the unique solution to a two-point boundary value problem, for a suitable system of discontinuous ordinary differential equations. Some additional assumptions are introduced, which yield a positive answer. In particular, this is true when there are exactly two players, or when all players assign the same exponential probability distribution to the incoming order. In both of these cases, we also prove that the Nash equilibrium is unique. A counterexample shows that these assumptions cannot be removed, in general. [ABSTRACT FROM AUTHOR]

In the literature, most known sequence transformations can be written as a ratio of two determinants. But, it is not always this case. One exception is that the sequence transformation proposed by Brezinski, Durbin, and Redivo-Zaglia cannot be expressed as a ratio of two determinants. Motivated by this, we will introduce a new algebraic tool—pfaffians, instead of determinants in the paper. It turns out that Brezinski-Durbin-Redivo-Zaglia’s transformation can be expressed as a ratio of two pfaffians. To the best of our knowledge, this is the first time to introduce pfaffians in the expressions of sequence transformations. Furthermore, an extended transformation of high order is presented in terms of pfaffians and a new convergence acceleration algorithm for implementing the transformation is constructed. Then, the Lax pair of the recursive algorithm is obtained which implies that the algorithm is integrable. Numerical examples with applications of the algorithm are also presented. [ABSTRACT FROM AUTHOR]

Tropical algebra is an emerging field with a number of applications in various areas of mathematics. In many of these applications appeal to tropical polynomials allows studying properties of mathematical objects such as algebraic varieties from the computational point of view. This makes it important to study both mathematical and computational aspects of tropical polynomials. In this paper we prove a tropical Nullstellensatz, and moreover, we show an effective formulation of this theorem. Nullstellensatz is a natural step in building algebraic theory of tropical polynomials and its effective version is relevant for computational aspects of this field. On our way we establish a simple formulation of min-plus and tropical linear dualities. We also observe a close connection between tropical and min-plus polynomial systems. [ABSTRACT FROM AUTHOR]

The main goal of this paper is to put on solid mathematical grounds the so-called non-equilibrium Green's function transport formalism for open systems. In particular, we derive the Jauho-Meir-Wingreen formula for the time-dependent current through an interacting sample coupled to non-interacting leads. Our proof is non-perturbative and uses neither complex-time Keldysh contours nor Langreth rules of 'analytic continuation.' We also discuss other technical identities (Langreth, Keldysh) involving various many-body Green's functions. Finally, we study the Dyson equation for the advanced/retarded interacting Green's function and we rigorously construct its (irreducible) self-energy, using the theory of Volterra operators. [ABSTRACT FROM AUTHOR]

For any x 휖 (0, 1], let the series ∑n=1∞1/dnx be the Sylvester expansion of x, where {dj(x), j ≥ 1} is a sequence of positive integers satisfying d1(x) ≥ 2 and dj + 1(x) ≥ dj(x)(dj(x) − 1) + 1 for j ≥ 1. Suppose ϕ : ℕ → ℝ+ is a function satisfying ϕ(n+1) - ϕ (n) → ∞ as n → ∞. In this paper, we consider the setEϕ=x∈01:limn→∞logdnx−∑j=1n−1logdjxϕn=1and quantify the size of the set in the sense of Hausdorff dimension. As applications, for any β > 1 and γ > 0, we get the Hausdorff dimension of the set x∈01:limn→∞logdnx−∑j=1n−1logdjx/nβ=γ, and for any τ > 1 and η > 0, we get a lower bound of the Hausdorff dimension of the set x∈01:limn→∞logdnx−∑j=1n−1logdjx/τn=η. [ABSTRACT FROM AUTHOR]

In this paper, we investigate hybrid power moments of generalized quadratic Gauss sums weighted with powers of Kloosterman sums and with powers of values of Dirichlet L-functions at 1. We obtain several exact formulas for prime and prime power modulus and some asymptotic formulas. [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]

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]

In this paper, we explore some unexplored consequences of Agliano et al. (Studia Logica 87:73-98, 2007) and Agliano and Montagna (J Pure Appl Algebra 181:105-129, 2003) on varieties of BL-algebras and their hoop subreducts. The main topics are: generation by finite algebras, the finite embeddability property and varieties of finite index. [ABSTRACT FROM AUTHOR]

This paper addresses several structural aspects of the insertion-elimination algebra $${\mathfrak{g}}$$ , a Lie algebra that can be realized in terms of tree-inserting and tree-eliminating operations on the set of rooted trees. In particular, we determine the finite-dimensional subalgebras of $${\mathfrak{g}}$$ , the automorphism group of $${\mathfrak{g}}$$ , the derivation Lie algebra of $${\mathfrak{g}}$$ , and a generating set. Several results are stated in terms of Lie algebras admitting a triangular decomposition and can be used to reproduce results for the generalized Virasoro algebras. [ABSTRACT FROM AUTHOR]

This paper proposes a definition of categorical model of the deep inference system BV, defined by Guglielmi. Deep inference introduces the idea of performing a deduction in the interior of a formula, at any depth. Traditional sequent calculus rules only see the roots of formulae. However in these new systems, one can rewrite at any position in the formula tree. Deep inference in particular allows the syntactic description of logics for which there is no sequent calculus. One such system is BV, which extends linear logic to include a noncommutative self-dual connective. This is the logic our paper proposes to model. Our definition is based on the notion of a linear functor, due to Cockett and Seely. A BV- category is a linearly distributive category, possibly with negation, with an additional tensor product which, when viewed as a bivariant functor, is linear with a degeneracy condition. We show that this simple definition implies all of the key isomorphisms of the theory. We consider Girard's category of probabilistic coherence spaces and show that it contains a self-dual monoidal structure in addition to the *-autonomous structure exhibited by Girard. This structure makes the category a BV-category. We believe this structure is also of independent interest, as well-behaved noncommutative operators generally are. [ABSTRACT FROM AUTHOR]

A storing of spatial data and processing of spatial queries are important tasks for modern data-bases. The execution efficiency of spatial query depends on underlying index structure. R-tree is a well-known spatial index structure. Currently there exist various versions of R-tree, and one of the most common variations between them is node splitting algorithm. The problem of node splitting in one-dimensional R-tree may seem to be too trivial to be considered separately. One-dimensional intervals can be split on the base of their sorting. Some of the node splitting algorithms for R-tree with two or more dimensions comprise one-dimensional split as their part. However, under detailed consideration, existing algorithms for one-dimensional split do not perform ideally in some complicated cases. This paper introduces a novel one-dimensional node splitting algorithm based on two sortings that can handle such complicated cases better. Also this paper introduces node splitting algorithm for R-tree with two or more dimensions that is based on the one-dimensional algorithm mentioned above. The tests show significantly better behavior of the proposed algorithms in the case of highly overlapping data. [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]

In this paper, we describe the BIBasis package designed for REDUCE and Macaulay2 computer algebra systems, which allows one to compute Boolean involutive bases and Gröbner bases. The implementations and user interfaces of the package for both systems are described in the respective sections of the paper. Also, we present results of comparisons of BIBasis with other packages and algorithms for constructing Boolean Gröbner bases available in the computer algebra systems. [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]

This paper introduces subgroups of the symmetric group and studies their combinatorial properties. Their elements are called parity alternating, because they are permutations with even and odd entries alternately. The objective of this paper is twofold. The first is to derive several properties of such permutations by subdividing them into even and odd permutations. The second is to discuss their combinatorial properties; among others, relationships between those permutations and signed Eulerian numbers. Divisibility properties by prime powers are also deduced for signed Eulerian numbers and several related numbers. [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]

Cholak, Groszek and Slaman proved in J Symb Log 66:881–901, 2001 that there is a nonzero computably enumerable (c.e.) degree cupping every low c.e. degree to a low c.e. degree. In the same paper, they pointed out that every nonzero c.e. degree can cup a low2 c.e. degree to a nonlow2 degree. In Jockusch et al. (Trans Am Math Soc 356:2557–2568, 2004) improved the latter result by showing that every nonzero c.e. degree c is cuppable to a high c.e. degree by a low2 c.e. degree b. It is natural to ask in which subclass of low2 c.e. degrees can b in Jockusch et al. (Trans Am Math Soc 356:2557–2568, 2004) be located. Wu proved in Math Log Quart 50:189–201, 2004 that b can be cappable. We prove in this paper that b in Jockusch, Li and Yang’s result can be noncuppable, improving both Jockusch, Li and Yang, and Wu’s results. [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 we construct a multiset S( f) of a Boolean function f consisting of the weights of the second derivatives of the function f with respect to all distinct two-dimensional subspaces of the domain. We refer to S( f) as the second derivative spectrum of f. The frequency distribution of the weights of these second derivatives is referred to as the weight distribution of the second derivative spectrum. It is demonstrated in this paper that this weight distribution can be used to distinguish affine nonequivalent Boolean functions. Given a Boolean function f on n variables we present an efficient algorithm having O( n22 n) time complexity to compute S( f). Using this weight distribution we show that all the 6-variable affine nonequivalent bents can be distinguished. We study the subclass of partial-spreads type bent functions known as PS ap type bents. Six different weight distributions are obtained from the set of PS ap bents on 8-variables. Using the second derivative spectrum we show that there exist 6 and 8 variable bent functions which are not affine equivalent to rotation symmetric bent functions. Lastly we prove that no non-quadratic Kasami bent function is affine equivalent to Maiorana–MacFarland type bent functions. [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]

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]

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]

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]

This paper is devoted to relations between the Kurosh problem and the Shirshov height theorem. The central point and main technical tool is the identity of algebraicity. The main result of this paper is the following. Let A be a finitely generated PI-algebra and Y be a finite subset of A. For any Noetherian associative and commutative ring {ie125-01}, let any factor of R ⊗ A such that all projections of elements from Y are algebraic over π( R) be a Noetherian R-module. Then A has bounded essential height over Y. If, furthermore, Y generates A as an algebra, then A has bounded height over Y in the Shirshov sense. This paper also contains a new proof of the Razmyslov-Kemer-Braun theorem on radical nilpotence of affine PI-algebras. This proof allows one to obtain some constructive estimates. The main goal of the paper is to develop a “virtual operator calculus.” Virtual operators (pasting, deleting, and transfer) depend not only on an element of the algebra but also on its representation. [ABSTRACT FROM AUTHOR]

The univariate spline quasi-interpolants (QIs) studied in this paper are approximation operators using B-spline expansions with coefficients that are linear combinations of discrete values of the function to be approximated. When working with nonuniform partitions, the main challenge is to find QIs that have both good approximation orders and uniform norms which are bounded independently of the given partition. Near-best QIs are obtained by minimizing an upper bound for the infinity norm of QIs depending on a certain number of free parameters, thus reducing this norm. This paper is devoted to the study of some families of near-best discrete quasi-interpolants (dQIs) of approximation order 3. [ABSTRACT FROM AUTHOR]