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]

University scientific research ability is an important indicator to express the strength of universities. In this paper, the evaluation of university scientific research ability is investigated based on the output of sci-tech papers. Four university alliances from North America, UK, Australia, and China, are selected as the case study of the university scientific research evaluation. Data coming from Thomson Reuters InCites are collected to support the evaluation. The work has contributed new framework to the issue of university scientific research ability evaluation. At first, we have established a hierarchical structure to show the factors that impact the evaluation of university scientific research ability. Then, a new MCDM method called D-AHP model is used to implement the evaluation and ranking of different university alliances, in which a data-driven approach is proposed to automatically generate the D numbers preference relations. Next, a sensitivity analysis has been given to show the impact of weights of factors and sub-factors on the evaluation result. At last, the results obtained by using different methods are compared and discussed to verify the effectiveness and reasonability of this study, and some suggestions are given to promote China’s scientific research ability. [ABSTRACT FROM AUTHOR]

A class of left bialgebroids whose underlying algebra A ♯ H is a smash product of a bialgebra H with a braided commutative Yetter–Drinfeld H -algebra A has recently been studied in relation to models of field theories on noncommutative spaces. In Borowiec and Pachoł (2017 J. Phys. A: Math. Theor. 50 055205) a proof has been presented that the bialgebroid A F ♯ H F where HF and AF are the twists of H and A by a Drinfeld 2-cocycle F = ∑ F 1 ⊗ F 2 is isomorphic to the twist of bialgebroid A ♯ H by the bialgebroid 2-cocycle ∑ 1 ♯ F 1 ⊗ 1 ♯ F 2 induced by F. They assume H is quasitriangular, which is reasonable for many physical applications. However the proof and the entire paper take for granted that the coaction and the prebraiding are both given by special formulas involving the R-matrix. There are counterexamples of Yetter–Drinfeld modules over quasitriangular Hopf algebras which are not of this special form. Nevertheless, the main result essentially survives. We present a proof with a general coaction and the correct prebraiding, and even without the assumption of quasitriangularity. [ABSTRACT FROM AUTHOR]

Let S be the polynomial ring on the space of non-square generic matrices or the space of odd-sized skew-symmetric matrices, and let I be the determinantal ideal of maximal minors or Pf the ideal of sub-maximal Pfaffians, respectively. Using desingularizations and representation theory of the general linear group we expand upon work of Raicu–Weyman–Witt [Adv. Math. 250 (2014), pp. 596–610] to determine the S-module structures of Ext^j_S(S/I^t, S) and Ext^j_S(S/Pf^t, S), from which we get the degrees of generators of these Ext modules. As a consequence, via graded local duality we answer a question of Wenliang Zhang [J. Pure Appl. Algebra 225 (2021), Paper No. 106789] on the socle degrees of local cohomology modules of the form H^j_\mathfrak {m}(S/I^t). [ABSTRACT FROM AUTHOR]

The authors replies to the comment made by Yang and Zhou (2024 J. Phys. A: Math. Theor.) on his 2015 paper entitled 'Critical points of Potts and O(N) models from eigenvalue identities in periodic Temperley–Lieb algebras' (Jacobsen 2015 J. Phys. A: Math. Theor. 48 454003). [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]

In this paper, we derive a Mittag-Leffler function for real index and establish solutions of special type of fractional order differential equations (FDEs). The same concept is extended to discrete case by replacing polynomials into factorial polynomials and differentiation into l-difference operator. Moreover, numerical examples of our results are stated to validate our findings. The acquired results here have the ability to generate a wide range of formulas in relation to newer results. [ABSTRACT FROM AUTHOR]

In 1966, B. O'Neill [The fundamental equations of a submersion, Michigan Math. J., Volume 13, Issue 4 (1966), 459-469.] defined some fundamental equations and curvature rela- tions between the total space, the base space and the fibres on a submersion. In the present paper, we define new curvature tensors on Riemannian submersions such as Weyl projective curvature tensor, concircular curvature tensor, conharmonic curvature tensor, conformal curvature tensor and M projective curvature tensor, respectively. Finally, we obtain some results in case of the total space of Riemannian submersions has umbilical fibres for any curvature tensors mentioned by the above. [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 define a q-linear path in a hypergraph H as a sequence (e1,. . ., eL) of edges of H such that |ei nei+1| [[1, q]] and ei n ej = Ø if |i-j| > 1. In this paper, we study the connected components associated to these paths when q = k - 2 where k is the rank of H. If k = 3 then q = 1 which coincides with the well-known notion of linear path or loose path. We describe the structure of the connected components, using an algorithmic proof which shows that the connected components can be computed in polynomial time. We then mention two consequences of our algorithmic result. The first one is that deciding the winner of the Maker-Breaker game on a hypergraph of rank 3 can be done in polynomial time. The second one is that tractable cases for the NP-complete problem of "Paths Avoiding Forbidden Pairs" in a graph can be deduced from the recognition of a special type of line graph of a hypergraph. [ABSTRACT FROM AUTHOR]

In this paper, we study the problem of gossiping with interference constraint in radio ring networks. Gossiping (or total exchange information) is a protocol where each node in the network has a message and is expected to distribute its own message to every other node in the network. The gossiping problem consists in finding the minimum running time (makespan) of a gossiping protocol and algorithms that attain this makespan. We focus on the case where the transmission network is a ring network. We consider synchronous protocols where it takes one unit of time (step) to transmit a unit-length message. During one step, a node receives at most one message only through one of its two neighbors. We also suppose that, during one step, a node cannot be both a sender and a receiver (half duplex model). Moreover communication is subject to interference constraints. We use a primary node interference model where, if a node receives a message from one of its neighbors, its other neighbor cannot send at the same time. With these assumptions we completely solve the problem for ring networks. We first show lower bounds and then give gossiping algorithms which meet these lower bounds and so are optimal. The number of rounds depends on the congruences of n modulo 12. [ABSTRACT FROM AUTHOR]

In this paper, the discovery of the Jones polynomial will be discussed, emphasizing the way in which it illustrated the remarkable unity between distinct parts of mathematics, each with its own language, but initially without a dictionary. [ABSTRACT FROM AUTHOR]

Let E be the Grassmann algebra of an infinite-dimensional vector space L over a field of characteristic zero. In this paper, we study the Z -gradings on E having the form E = E (r 1 , r 2 , r 3) (v 1 , v 2 , v 3) , in which each element of a basis of L has Z -degree r 1 , r 2 , or r 3 . We provide a criterion for the support of this structure to coincide with a subgroup of the group Z , and we describe the graded identities for the corresponding gradings. We strongly use Elementary Number Theory as a tool, providing an interesting connection between this classical part of Mathematics, and PI Theory. Our results are generalizations of the approach presented in Brandão A, Fidelis C, Guimarães A. Z -gradings of full support on the Grassmann algebra. J Algebra. 2022;601:332–353. DOI:10.1016/j.jalgebra.2022.03.014. See also in arXiv preprint, arXiv:2009.01870v1, 2020]. [ABSTRACT FROM AUTHOR]

In [Math. Ann. 367 (2017), pp. 1517–1586] Bar-Natan and the first author show that solutions to the Kashiwara–Vergne equations are in bijection with certain knot invariants: homomorphic expansions of welded foams. Welded foams are a class of knotted tubes in \mathbb {R}^4, which can be finitely presented algebraically as a circuit algebra , or equivalently, a wheeled prop. In this paper we describe the Kashiwara-Vergne groups \mathsf {KV} and \mathsf {KRV}—the symmetry groups of Kashiwara-Vergne solutions—as automorphisms of the completed circuit algebras of welded foams, and their associated graded circuit algebras of arrow diagrams, respectively. Finally, we provide a description of the graded Grothendieck-Teichmüller group \mathsf {GRT}_1 as automorphisms of arrow diagrams. [ABSTRACT FROM AUTHOR]

Algebraic quantum groupoids have been developed by two of the authors of this note (AVD and SHW) in a series of papers [A. Van Daele and S. Wang, Weak multiplier Hopf algebras. Preliminaries, motivation and basic examples, Banach Center Publ. 98 (2012) 367–415; A. Van Daele and S. Wang, Weak multiplier Hopf algebras I. The main theory, J. Reine Angew. Math. 705 (2015) 155–209; A. Van Daele and S. Wang, Weak multiplier Hopf algebras II. The source and target algebras, preprint (2014), arXiv: 1403.7906v2 [math.RA]; A. Van Daele and S. Wang, Weak multiplier Hopf algebras III. Integrals and duality, preprint (2017), arXiv: 1701.04951 [math.RA]], see also [A. Van Daele, Algebraic quantum groupoids. An example, preprint (2017), arXiv: 1702.04903 [math.RA]]. By an algebraic quantum groupoid, we understand a regular weak multiplier Hopf algebra with enough integrals. Regular multiplier Hopf algebroids are obtained also by two authors of this note (TT and AVD) in [T. Timmermann and A. Van Daele, Regular multiplier Hopf algebroids. Basic theory and examples, Commun. Algebra 46 (2017) 1926–1958]. Integral theory and duality for those have been studied by one author here (TT) in [T. Timmermann, Integration on algebraic quantum groupoids, Int. J. Math. 27 (2016) 1650014, arXiv: 1507.00660 [QA]; T. Timmermann, On duality of algebraic quantum groupoids, Adv. Math. 309 (2017) 692–746, arXiv: 1605.06384 [math.QA]]. In these papers, the term algebraic quantum groupoid is used for a regular multiplier Hopf algebroid with a single faithful integral. Finally, again two authors of us (TT and AVD) have investigated the relation between weak multiplier Hopf algebras and multiplier Hopf algebroids in [T. Timmermann and A. Van Daele, Multiplier Hopf algebroids arising from weak multiplier Hopf algebras, Banach Center Publ. 106 (2015) 73–110]. In the paper, Weak multiplier Hopf algebras III. Integrals and duality [A. Van Daele and S. Wang, Weak multiplier Hopf algebras III. Integrals and duality, preprint (2017), arXiv: 1701.04951 [math.RA]], one of the main results is that the dual of an algebraic quantum groupoid, admits a dual of the same type. In the paper, On duality of algebraic quantum groupoids [T. Timmermann, On duality of algebraic quantum groupoids, Adv. Math. 309 (2017) 692–746, arXiv: 1605.06384 [math.QA]], a result of the same nature is obtained for regular multiplier Hopf algebroids with a single faithful integral. The duality of regular weak multiplier Hopf algebras with a single integral can be obtained from the duality of regular multiplier Hopf algebroids (see [T. Timmermann, On duality of algebraic quantum groupoids, Adv. Math. 309 (2017) 692–746, arXiv: 1605.06384 [math.QA]]). That is however not the obvious way to obtain this result. It is more difficult and less natural than the direct way followed in [A. Van Daele and S. Wang, Weak multiplier Hopf algebras III. Integrals and duality, preprint (2017), arXiv: 1701.04951 [math.RA]]. We will discuss this statement further in the paper. Nevertheless, it is interesting to investigate the relation between the two approaches to duality in greater detail. This is what we do in this paper. We build further on the intimate relation between weak multiplier Hopf algebras and multiplier Hopf algebroids as studied in [T. Timmermann and A. Van Daele, Multiplier Hopf algebroids arising from weak multiplier Hopf algebras, Banach Center Publ. 106 (2015) 73–110]. We now add the presence of integrals. That seems to be done best in a framework of dual pairs. It is in fact more general than the duality of these objects coming with integrals. We are convinced that the material we present in this paper will provide a deeper understanding of the duality of algebraic quantum groupoids, both within the framework of weak multiplier Hopf algebras, as well as more generally for multiplier Hopf algebroids. Finally, we feel it is also appropriate to include some historical comments on the development of these duality theories. [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]

This paper is a continuation of the paper, Matsumoto ['Subshifts, $\lambda $ -graph bisystems and $C^*$ -algebras', J. Math. Anal. Appl. 485 (2020), 123843]. A $\lambda $ -graph bisystem consists of a pair of two labeled Bratteli diagrams satisfying a certain compatibility condition on their edge labeling. For any two-sided subshift $\Lambda $ , there exists a $\lambda $ -graph bisystem satisfying a special property called the follower–predecessor compatibility condition. We construct an AF-algebra ${\mathcal {F}}_{\mathcal {L}}$ with shift automorphism $\rho _{\mathcal {L}}$ from a $\lambda $ -graph bisystem $({\mathcal {L}}^-,{\mathcal {L}}^+)$ , and define a $C^*$ -algebra ${\mathcal R}_{\mathcal {L}}$ by the crossed product. It is a two-sided subshift analogue of asymptotic Ruelle algebras constructed from Smale spaces. If $\lambda $ -graph bisystems come from two-sided subshifts, these $C^*$ -algebras are proved to be invariant under topological conjugacy of the underlying subshifts. We present a simplicity condition of the $C^*$ -algebra ${\mathcal R}_{\mathcal {L}}$ and the K-theory formulas of the $C^*$ -algebras ${\mathcal {F}}_{\mathcal {L}}$ and ${\mathcal R}_{\mathcal {L}}$. The K-group for the AF-algebra ${\mathcal {F}}_{\mathcal {L}}$ is regarded as a two-sided extension of the dimension group of subshifts. [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]

In this paper, we describe an educational experience in the context of the Master's degree that is compulsory in Spain to become a secondary education mathematics teacher. Master's students from two universities in Madrid (Spain) attended lectures that addressed—emphasizing the concourse of a dynamic geometry software package—some historical, didactic and mathematical issues related to linkage mechanisms, such as those arising in the 18th and 19th centuries during the development of the steam engine. Afterwards, participants were asked to provide three different kinds of feedback: (i) working on an assigned group task, (ii) individually answering a questionnaire, and (iii) proposing some classroom activity, imagining it would be addressed to their prospective pupils. All three issues focused on the specific topic of the attended lectures. In the framework of Mason's reflective discourse analysis, the information supplied by the participants has been analyzed. The objective was to explore what they have learned from the experience and what their perception is of the potential interest in linkages as a methodological instrument for their future professional activity as teachers. This analysis is then the basis upon which to reflect on the opportunities (and problems) that this particular bar-joint linkages methodological approach could bring towards providing future mathematics teachers with attractive tools that would contribute to enhancing a STEAM-oriented education. Finally, the students' answers allow us to conclude that the experience was beneficial for these pre-service teachers, both in improving their knowledge on linkages history, mathematics, industrial, technological and artistic applications, and in enhancing the use in the classroom of this very suitable STEAM context. [ABSTRACT FROM AUTHOR]

Let k 1 be an integer, and let G be a finite and simple graph with vertex set V (G). A signed total Italian k-dominating function on a graph G is a function f: V (G) ! f1; 1; 2g such that P u2N(v) f(u) ≥ k for every v 2 V (G), where N(v) is the neighborhood of v, and each vertex u with f(u) = 1 is adjacent to a vertex v with f(v) = 2 or to two vertices w and z with f(w) = f(z) = 1. A set ff1; f2;: ::; fdg of distinct signed total Italian k-dominating functions on G with the property that Pd i=1 fi(v) ≤ k for each v 2 V (G), is called a signed total Italian k-dominating family (of functions) on G. The maximum number of functions in a signed total Italian k-dominating family on G is the signed total Italian k-domatic number of G, denoted by dk stI (G). In this paper we initiate the study of signed total Italian k-domatic numbers in graphs, and we present sharp bounds for dk stI (G). In addition, we determine the signed total Italian k-domatic number of some graphs. [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]

With the untimely passing of Patrick Dehornoy in September 2019, the world of mathematics lost a brilliant scholar who made profound contributions to set theory, algebra, topology, and even computer science and cryptography. And I lost a dear friend and a strong influence in the direction of my own research in mathematics. In this paper, I will concentrate on his remarkable discovery that the braid groups are left-orderable, and its consequences, and its strong influence on my own research. I'll begin by describing how I learned of his work. [ABSTRACT FROM AUTHOR]

An S-Topological BE-Algebras(STBE-Algebras) is a BE-Algebra equipped with a special type of topology that makes the operation (defined on it)as S-topological continuous. In this paper, we discuss the separation axioms on a STBE-Algebras. [ABSTRACT FROM AUTHOR]

In this paper, we introduce some important basic notions and operations of a matrix of matrices (for shorting, MMs) polynomials. We use these notions to motivate the definitions of the division of MMs polynomial and to illustrate their properties. Also, we study the generalized Bezoute theorem and the Cayley-Hamilton theorem over MMs. The block companion MMs is established. Furthermore, this paper is concerned with the construction of the right and left solvents of an MMs polynomial from latent roots and vectors. [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]

Several lifetime distributions have played an important role to fit survival data. However, for some of these models, the computation of maximum likelihood estimators is quite difficult due to presence of flat regions in the search space, among other factors. Several well-known derivative-based optimization tools are unsuitable for obtaining such estimates. To circumvent this problem, we introduce the AdequacyModel computational library version 2.0.0 for the R statistical environment with two major contributions: a general optimization technique based on the Particle Swarm Optimization (PSO) method (with a minor modification of the original algorithm) and a set of statistical measures for assessment of the adequacy of the fitted model. This library is very useful for researchers in probability and statistics and has been cited in various papers in these areas. It serves as the basis for the Newdistns library (version 2.1) published in an impact journal in the area of computational statistics, see . It is also the basis of the Wrapped library (version 2.0), see . A third package making use of the AdequacyModel library can be found in . In addition, the proposed library has proved to be very useful for maximizing log-likelihood functions with complex search regions. The library provides a greater control of the optimization process by introducing a stop criterion based on a minimum number of iterations and the variance of a given proportion of optimal values. We emphasize that the new library can be used not only in statistics but in physics and mathematics as proved in several examples throughout the paper. [ABSTRACT FROM AUTHOR]

Complex network theory has been successful at unveiling the topology of the brain and showing alterations to the network structure due to brain disease, cognitive function and behavior. Functional connectivity networks (FCNs) represent different brain regions as the nodes and the connectivity between them as the edges of a graph. Graph theoretic measures provide a way to extract features from these networks enabling subsequent characterization and discrimination of networks across conditions. However, these measures are constrained mostly to binary networks and highly dependent on the network size. In this paper, we propose a novel graph-to-signal transform that overcomes these shortcomings to extract features from functional connectivity networks. The proposed transformation is based on classical multidimensional scaling (CMDS) theory and transforms a graph into signals such that the Euclidean distance between the nodes of the network is preserved. In this paper, we propose to use the resistance distance matrix for transforming weighted functional connectivity networks into signals. Our results illustrate how well-known network structures transform into distinct signals using the proposed graph-to-signal transformation. We then compute well-known signal features on the extracted graph signals to discriminate between FCNs constructed across different experimental conditions. Based on our results, the signals obtained from the graph-to-signal transformation allow for the characterization of functional connectivity networks, and the corresponding features are more discriminative compared to graph theoretic measures. [ABSTRACT FROM AUTHOR]

In this paper, we provide generating functions and counting formulas for spanning trees and spanning forests in hypergraphs in two different ways: (1) We represent spanning trees and spanning forests in hypergraphs through Berezin-Grassmann integrals on Zeon algebra and hyper-Hafnians (orders and signs are not considered); (2) We establish a Hyper-Pfaffian-Cactus Spanning Forest Theorem through Berezin-Grassmann integrals on Grassmann algebra (orders and signs are considered), which generalizes the Hyper-Pfaffian-Cactus Theorem by Abdesselam (2004) [1] and Pfaffian matrix tree theorem by Masbaum and Vaintrob (2002) [15]. • We provide generating functions and counting formulas for spanning trees and spanning forests in hypergraphs through Berezin-Grassmann integrals on Zeon algebra and hyper- Hafnians when orders and signs are not considered. • We establish a Hyper-Pfaffian-Cactus Spanning Forest Theorem through Berezin-Grassmann integrals on Grassmann algebra (orders and signs are considered), which generalizes the Hyper-Pfaffian-Cactus Theorem by Abdesselam [Advances in Applied Mathematics (2004) Vol. 33: 51-70] and Pfaffian matrix tree theorem by Masbaum and Vaintrob [Internat. Math. Res. Notices (2002) Vol. 27: 1397-1426]. [ABSTRACT FROM AUTHOR]

In [A.-P. Grecianu, A. Kvaschuk, A. G. Myasnikov and D. Serbin, Groups acting on hyperbolic Λ -metric spaces, Int. J. Algebra Comput. 25(6) (2015) 977–1042], the authors initiated a systematic study of hyperbolic Λ -metric spaces, where Λ is an ordered abelian group, and groups acting on such spaces. The present paper concentrates on the case Λ = ℤ n taken with the right lexicographic order and studies the structure of finitely generated groups acting on hyperbolic ℤ n -metric spaces. Under certain constraints, the structure of such groups is described in terms of a hierarchy (see [D. T. Wise, The Structure of Groups with a Quasiconvex Hierarchy : (AMS- 2 0 9) , Annals of Mathematics Studies (Princeton University Press, 2021)]) similar to the one established for ℤ n -free groups in [O. Kharlampovich, A. G. Myasnikov, V. N. Remeslennikov and D. Serbin, Groups with free regular length functions in ℤ n , Trans. Amer. Math. Soc. 364 (2012) 2847–2882]. [ABSTRACT FROM AUTHOR]

In this short note we correct the statement of the main result of [Trans. Amer. Math. Soc. 373 (2020), no. 3, 1909-1940]. That paper presented the rational cohomology ring of a toric arrangement by generators and relations. One of the series of relations given in the paper is indexed over the set circuits in the arrangement's arithmetic matroid. That series of relations should however be indexed over all sets X with |X| = rk(X)+1. Below we give the complete and correct presentation of the rational cohomology ring. [ABSTRACT FROM AUTHOR]

Aiming at serving the interdisciplinary demand in network science, this paper introduces a new concept for complex networks, named network stiffness, which is extracted from structural engineering by assuming that a complex network behaves similarly with a structured framework. This analogy allows interpreting that a complex network can resist against any cause attempting to induce deformation changes to the network’s structure, regardless of whether the network is material or not. Within this framework, this paper examines the context of applying the conceptual analogy of stiffness from the field of structural engineering to network science and then it develops computational approaches capturing different aspects of network stiffness so that to be used in complex network analysis. The implementation of these approaches to a real-world network (global inbound tourism network) shows that stiffness can produce interesting insights to complex network analysis about the factors related to changes caused to the structure and the status of a complex network. [ABSTRACT FROM AUTHOR]

This paper proposes a new quantum-like method for the binary classification applied to classical datasets. Inspired by the quantum Helstrom measurement, this innovative approach has enabled us to define a new classifier, called Helstrom Quantum Centroid (HQC). This binary classifier (inspired by the concept of distinguishability between quantum states) acts on density matrices—called density patterns—that are the quantum encoding of classical patterns of a dataset. In this paper we compare the performance of HQC with respect to twelve standard (linear and non-linear) classifiers over fourteen different datasets. The experimental results show that HQC outperforms the other classifiers when compared to the Balanced Accuracy and other statistical measures. Finally, we show that the performance of our classifier is positively correlated to the increase in the number of “quantum copies” of a pattern and the resulting tensor product thereof. [ABSTRACT FROM AUTHOR]

In this paper, we present a study on a network-based susceptible-infected-recovered (SIR) epidemic model with a saturated treatment function. It is well known that treatment can have a specific effect on the spread of epidemics, and due to the limited resources of treatment, the number of patients during severe disease outbreaks who need to be treated may exceed the treatment capacity. Consequently, the number of patients who receive treatment will reach a saturation level. Thus, we incorporated a saturated treatment function into the model to characterize such a phenomenon. The dynamics of the present model is discussed in this paper. We first obtained a threshold value R 0 , which determines the stability of a disease-free equilibrium. Furthermore, we investigated the bifurcation behavior at R 0 = 1. More specifically, we derived a condition that determines the direction of bifurcation at R 0 = 1. If the direction is backward, then a stable disease-free equilibrium concurrently exists with a stable endemic equilibrium even though R 0 < 1. Therefore, in this case, R 0 < 1 is not sufficient to eradicate the disease from the population. However, if the direction is forward, we find that for a range of parameters, multiple equilibria could exist to the left and right of R 0 = 1. In this case, the initial infectious invasion must be controlled to a lower level so that the disease dies out or approaches a lower endemic steady state. [ABSTRACT FROM AUTHOR]

This paper proposes a mixture regression model-based method for drug sensitivity prediction. The proposed method explicitly addresses two fundamental issues in drug sensitivity prediction, namely, population heterogeneity and feature selection pertaining to each of the subpopulations. The mixture regression model is estimated using the imputation-conditional consistency algorithm, and the resulting estimator is consistent. This paper also proposes an average-BIC criterion for determining the number of components for the mixture regression model. The proposed method is applied to the CCLE dataset, and the numerical results indicate that the proposed method can make a drastic improvement over the existing ones, such as random forest, support vector regression, and regularized linear regression, in both drug sensitivity prediction and feature selection. The p-values for the comparisons in drug sensitivity prediction can reach the order O(10−8) or lower for the drugs with heterogeneous populations. [ABSTRACT FROM AUTHOR]

Learning and teaching algebra concepts are frequent problems for both students and teachers alike. Students struggle to learn algebra, and teachers struggle to identify the best way to teach algebra. It is recurrent that teachers use instructional methods that promote memorization, and, consequently, the learning process may prove unsatisfactory. This paper introduces Virtual Algebra Tiles, an open educational resource whose purpose is to enable students to use algebra tiles from a computer to enhance their knowledge of algebra concepts. To evaluate the effectiveness of the system, we designed a case study. The participants were 40 students of engineering degrees who were randomly assigned to experimental or control groups. Results indicate that the system has a large effect size (ES = 0.83, p < 0.001) on learning effectiveness and a promising long‐term knowledge retention (ES = 0.79, p < 0.001). Students concluded that this version of algebra tiles is more motivating than other versions, because it is presented in a format that stands natural to them. Students feel more comfortable in virtual environments, and therefore, the learning process becomes a more pleasant task. Lay Description: What is already known about this topic: Inadequate teaching methodologies can lead to student failure.It is necessary to decrease the emphasis on memorization and to favour active learning techniques.The use of mathematical manipulatives increases students' learning gains.Algebra tiles are an educational resource that helps students understand algebra concepts by using geometric figures. What this paper adds: Virtual Algebra Tiles is a multimedia version of the educational resource algebra tiles.Virtual Algebra Tiles has a large effect size on students' learning achievements.Virtual Algebra Tiles improves students' long‐term knowledge retention. Implications for practices and/or policy: Teachers should participate in the development of digital pedagogical material to enrich their lectures.It is necessary to develop more open educational resources, which can be accessed by students and teachers.Digital educational resources must take into account the special needs of particular users. [ABSTRACT FROM AUTHOR]

Highlights • The paper contributes set-membership regression (SMR), a new approach to nonlinear parameter estimation under measurement uncertainty. • Links between SMR and both guaranteed parameter estimation and classical statistical inference are investigated. • Several approaches to describing tight enclosures of the SMR regions using complete- search methods are developed. • Case studies are presented to illustrate various theoretical and computational aspects of SMR. Abstract This paper introduces set-membership nonlinear regression (SMR), a new approach to nonlinear regression under uncertainty. The problem is to determine the subregion in parameter space enclosing all (global) solutions to a nonlinear regression problem in the presence of bounded uncertainty on the observed variables. Our focus is on nonlinear algebraic models. We investigate the connections of SMR with (i) the classical statistical inference methods, and (ii) the usual set-membership estimation approach where the model predictions are constrained within bounded measurement errors. We also develop a computational framework to describe tight enclosures of the SMR regions using semi-infinite programming and complete-search methods, in the form of likelihood contour and polyhedral enclosures. The case study of a parameter estimation problem in microbial growth is presented to illustrate various theoretical and computational aspects of the SMR approach. [ABSTRACT FROM AUTHOR]

Highlights • Generating Pareto curves to show the optimal trade-off between Robustness and Performance. • Find the optimal PI and PID controller for First-Order and Integrating Plus Delay Processes. • Investigating the difference between ideal and serial PID, and the impact of filtering. • Comprehensive comparison between optimal-, SIMC- and "improved" SIMC-tuning. Abstract The first-order plus delay process model with parameters k (gain), τ (time constant) and θ (delay) is the most used representation of process dynamics. This paper has three objectives. First, we derive optimal PI- and PID-settings for this process. Optimality is here defined as the minimum Integrated Absolute Error (IAE) to disturbances for a given robustness level. The robustness level, which is here defined as the sensitivity peak (M s), may be regarded as a tuning parameter. Second, we compare the optimal IAE-performance with the simple SIMC-rules, where the SIMC tuning parameter τ c is adjusted to get a given robustness. The "original" SIMC-rules give a PI-controller for a first-order with delay process, and we find that this SIMC PI-controller is close to the optimal PI-controller for most values of the process parameters (k , τ , θ). The only exception is for delay-dominant processes where the SIMC-rule gives a pure integrating controller. The third objective of this paper is to propose and study a very simple modification to the original SIMC-rule, which is to add a derivative time τ d = θ /3 (for the serial PID-form). This gives performance close to the IAE-optimal PID also for delay-dominant processes. We call this the "improved" SIMC-rule, but we put "improved" in quotes, because this controller requires more input usage, so in practice the original SIMC-rule, which gives a PI-controller, may be preferred. [ABSTRACT FROM AUTHOR]

Outlier removal is a fundamental data processing task to ensure the quality of scanned point cloud data (PCD), which is becoming increasing important in industrial applications and reverse engineering. Acquired scanned PCD is usually noisy, sparse and temporarily incoherent. Thus the processing of scanned data is typically an ill-posed problem. In the paper, we present a simple and effective method based on two geometrical characteristics constraints to trim the noisy points. One of the geometrical characteristics is the local density information and another is the deviation from the local fitting plane. The local density based method provides a preprocessing step, which could remove those sparse outlier and isolated outlier. The non-isolated outlier removal in this paper depends on a local projection method, which placing those points onto objects. There is no doubt that the deviation of any point from the local fitting plane should be a criterion to reduce the noisy points. The experimental results demonstrate the ability to remove the noisy point from various man-made objects consisting of complex outlier. [ABSTRACT FROM AUTHOR]

Let R be a standard graded Gorenstein algebra over a field presented by quadrics. In [Compositio Math. 129 (2001), no. 1, 95-121], Conca-Rossi-Valla show that such a ring is Koszul if reg R ≤ 2 or if reg R = 3 and c = codim R ≤ 4, and they ask whether this is true for reg R = 3 in general. We determine sufficient conditions on a non-Koszul quadratic Cohen-Macaulay ring R that guarantee the Nagata idealization ~ R = R × ωR(−a−1) is a non-Koszul quadratic Gorenstein ring. We prove there exist rings of regularity 3 satisfying our conditions for all c ≥ 9; this yields a negative answer to the question from the above-mentioned paper. [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]

All the results on semigroups obtained using only sets, can be written in an abstract form in a more general setting. Let us consider a recent paper to justify what we say. The biinterior ideals of semigroups introduced and studied by M. Murali Krishna Rao in Discuss. Math. Gen. Algebra Appl. in 2018, follow for more general statements about ordered semigroups. The same holds for every result of this sort on semigroups based on right (left) ideals, bi-ideals, quasiideals, interior ideals etc. for which we use sets. As a result, we have an abstract formulation of the results on semigroups obtained by sets that is in the same spirit with the abstract formulation of general topology (the so-called topology without points) initiated by Koutský, Nöbeling and, even earlier, by Chittenden, Terasaka, Nakamura, Monteiro and Ribeiro. As a consequence, results on ordered Γ-hypersemigroups and on similar simpler structures can be obtained. [ABSTRACT FROM AUTHOR]

Recently, the problem of bounding the sup norms of L2-normalized cuspidal automorphic newforms ϕ on GL2 in the level aspect has received much attention. However at the moment strong upper bounds are only available if the central character χ of ϕ is not too highly ramified. In this paper, we establish a uniform upper bound in the level aspect for general χ. If the level N is a square, our result reduces to ∥ϕ∥∞ ≪ N1/4 + ϵ, at least under the Ramanujan Conjecture. In particular, when χ has conductor N, this improves upon the previous best known bound ∥ϕ∥∞ ≪ N1/2 + ϵ in this setup (due to [A. Saha, Hybrid sup-norm bounds for Maass newforms of powerful level, Algebra Number Theory 11 2017, 1009–1045]) and matches a lower bound due to [N. Templier, Large values of modular forms, Camb. J. Math. 2 2014, 1, 91–116], thus our result is essentially optimal in this case. [ABSTRACT FROM AUTHOR]

This paper reports on themes that arose in an investigation of university lecturers' views on the teaching of linear algebra. This focus on themes was the initial part of a study concentrating on four areas: What is important to teach in a first course in linear algebra? Are there teaching methods which are particularly suited for such a course? Are there tools that should/should not be used; and do the answers to these questions vary according to the degree (Engineering or Mathematics) the students follow? Questionnaire data was coded using thematic analysis which generated 11 themes related to the four questions above. The Results section presents the themes. The Discussion section considers the themes as a whole; splits – dualities – in teaching linear algebra; students' challenges with abstraction; aspects of doing mathematics; and pedagogical issues. [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]

Let g be the derived subalgebra of a Kac-Moody Lie algebra of finite-type or affine-type, let μ be a diagram automorphism of g, and let L(g,μ) be the loop algebra of g associated to μ. In this paper, by using the vertex algebra technique, we provide a general construction of current-type presentations for the universal central extension g[μ] of L(g,μ). The construction contains the classical limit of Drinfeld's new realization for (twisted and untwisted) quantum affine algebras [Soviet Math. Dokl. 36 (1988), pp. 212-216] and the Moody-Rao-Yokonuma presentation for toroidal Lie algebras [Geom. Dedicata 35 (1990), pp. 283-307] as special examples. As an application, when g is of simply-laced-type, we prove that the classical limit of the μ-twisted quantum affinization of the quantum Kac-Moody algebra associated to g introduced in [J. Math. Phys. 59 (2018), 081701] is the universal enveloping algebra of g[μ]. [ABSTRACT FROM AUTHOR]

Several network features and information retrieval methods have been proposed to elucidate the structure of citation networks and to detect important nodes. However, it is difficult to retrieve information related to trends in an academic field and to detect cutting-edge areas from the citation network. In this paper, we propose a novel framework that detects the trend as the growth direction of a citation network using network representation learning(NRL). We presume that the linear growth of citation network in latent space obtained by NRL is the result of the iterative edge additional process of a citation network. On APS datasets and papers of some domains of the Web of Science, we confirm the existence of trends by observing that an academic field grows in a specific direction linearly in latent space. Next, we calculate each node’s degree of trend-following as an indicator called the intrinsic publication year (IPY). As a result, there is a correlation between the indicator and the number of future citations. Furthermore, a word frequently used in the abstracts of cutting-edge papers (high-IPY paper) is likely to be used often in future publications. These results confirm the validity of the detected trend for predicting citation network growth. [ABSTRACT FROM AUTHOR]

This paper is concerned with the potential multistability of protein concentrations in the cell. That is, situations where one, or a family of, proteins may sit at one of two or more different steady state concentrations in otherwise identical cells, and in spite of them being in the same environment. For models of multisite protein phosphorylation for example, in the presence of excess substrate, it has been shown that the achievable number of stable steady states can increase linearly with the number of phosphosites available. In this paper, we analyse the consequences of adding enzyme docking to these and similar models, with the resultant sequestration of phosphatase and kinase by the fully unphosphorylated and by the fully phosphorylated substrates respectively. In the large molecule numbers limit, where deterministic analysis is applicable, we prove that there are always values for these rates of sequestration which, when exceeded, limit the extent of multistability. For the models considered here, these numbers are much smaller than the affinity of the enzymes to the substrate when it is in a modifiable state. As substrate enzyme-sequestration is increased, we further prove that the number of steady states will inevitably be reduced to one. For smaller molecule numbers a stochastic analysis is more appropriate, where multistability in the large molecule numbers limit can manifest itself as multimodality of the probability distribution; the system spending periods of time in the vicinity of one mode before jumping to another. Here, we find that substrate enzyme sequestration can induce bimodality even in systems where only a single steady state can exist at large numbers. To facilitate this analysis, we develop a weakly chained diagonally dominant M-matrix formulation of the Chemical Master Equation, allowing greater insights in the way particular mechanisms, like enzyme sequestration, can shape probability distributions and therefore exhibit different behaviour across different regimes. [ABSTRACT FROM AUTHOR]

The nodes and their connection relationships are the two main bodies for dynamic complex networks. In existing theoretical researches, the phenomena of stabilization and synchronization for complex dynamical networks are generally regarded as the dynamic characteristic behaviors of the nodes, which are mainly caused by coupling effect of connection relationships between nodes. However, the connection relationships between nodes are also one main body of a time-varying dynamic complex network, and thus they may evolve with time and maybe show certain characteristic phenomena. For example, the structural balance in the social networks and the synaptic facilitation in the biological neural networks. Therefore, it is important to investigate theoretically the reasons in dynamics for the occurrence. Especially, from the angle of large-scale systems, how the dynamic behaviors of nodes (such as the individuals, neurons) contribute to the connection relationships is one of worthy research directions. In this paper, according to the structural balance theory of triad proposed by F. Heider, we mainly focus on the connection relationships body, which is regarded as one of the two subsystems (another is the nodes body), and try to find the dynamic mechanism of the structural balance with the internal state behaviors of the nodes. By using the Riccati linear matrix differential equation as the dynamic model of connection relationships subsystem, it is proved under some mathematic conditions that the connection relationships subsystem is asymptotical structural balance via the effects of the coupling roles with the internal state of nodes. Finally, the simulation example is given to show the validity of the method in this paper. [ABSTRACT FROM AUTHOR]