A SPECIAL KIND OF PRINCIPAL CONGRUENCES ON MS-ALGEBRAS

In this article, for any a in the MS-algebra L, the author considers the con- gruence of the form defined by （x,y） ∈θa→←x∧a°° = y ∧a° and x ∨ a°° = y ∨ a°°. A characterization of subdirectly irreducible MS-algebras is given and it is also proved that the union of two principal congruences having this form is a principal congruence if and only if L ∈ K2 ∨ K3.

ON SYMMETRIC EXTENDED MS-ALGEBRAS WHOSE CONGRUENCES ARE PERMUTABLE

Algebras whose congruences are permutable were investigated by a number of authors in the literature. In this paper, we study the symmetric extended MS-algebras whose congruences are permutable. Some results obtained by Jie Fang on symmetric extended De Morgan algebras are generalized.

COBORDISM AND ROKHLIN CONGRUENCES

In this paper, we give a cobordism proof of the higher dimensional Rokhlin congruences established in [8].

Rectangular Ring Congruences on an E-inversive Semiring

In this paper, we discussed the property of rectangular band semiring congruence and ring congruence on a semiring and gave some characterizations and structure of rectangular ring congruence on an E-inversive semiring.

One Class of the Least Congruences on Completely Regular Semigroups

Congruence is a very important aspect in the study of the semigroup theory.In general,the Kernel-trace characterizations,Green's relations and subvarieties are main tools in the consideration of congruences on completely regular semigroups.In this paper,we give one class of congruences on completely regular semigroups with the representation of wreath product of translational hulls on completely simple semigroups.By this new way,the least Clifford semigroup congruences on completely regular semigroups are generalized.

On the Error Term for the Number of Solutions of Certain Congruences

Let f(x) be an irreducible polynomial of degree m ≥ 2 with integer coefficients,and let r(n) denote the number of solutions x of the congruence f(x) ≡ 0(mod n) satisfying0 ≤ x < n. Define ?(x) =Σ 1≤n≤x r(n)-αx, where α is the residue of the Dedekind zeta function ζ(s, K) at its simple pole s = 1. In this paper it is shown that ∫_1~X?~2(x)dx? ε{X^(3-6/m+3+ε)if m ≥ 3,X^(2+ε) if m = 2,for any non-Abelian polynomial f(x) and any ε > 0. This result constitutes an improvement upon that of Lü for the error terms on average.

Fibonacci Congruences and Applications

When we study a congruence T(x) ≡ ax modulo m as pseudo random number generator, there are several means of ensuring the independence of two successive numbers. In this report, we show that the dependence depends on the continued fraction expansion of m/a. We deduce that the congruences such that m and a are two successive elements of Fibonacci sequences are those having the weakest dependence. We will use this result to obtain truly random number sequences xn. For that purpose, we will use non-deterministic sequences yn. They are transformed using Fibonacci congruences and we will get by this way sequences xn. These sequences xn admit the IID model for correct model.

Super Congruences Involving Alternating Harmonic Sums

Let p be an odd prime, the harmonic congruence such as , and many different variations and generalizations have been studied intensively. In this note, we consider the congruences involving the combination of alternating harmonic sums, where PP denotes the set of positive integers which are prime to p. And we establish the combinational congruences involving alternating harmonic sums for positive integer n=3,4,5.

Congruences on an Orthodox Semigroup

Let 5 be an orthodox semigroup and γ the least inverse congruence on 5. C(S) denotes the set of all congruences on S. In this paper we introduce the concept of admissible triples for S, where admissible triples are constructed by the congruences on S/γ , the equivalences on E(S)/L and E(S)/R. The notation Ca(S) denotes the set of all admissible triple for S. We prove that every congruence ρ on S can be uniquely determined by the admissible triple induced by ρ, and there exists a lattice isomomorphism between C(S) and Ca(S).

Some Implications of the Gessel Identity

We generalize the congruences of Friedmann-Tamarkine (1909), Lehmer (1938), and Ernvall-Metsänkyla (1991) on the sums of powers of integers weighted by powers of the Fermat quotients to the next Fermat quotient power, namely to the third power of the Fermat quotient. Using this result and the Gessel identity (2005) combined with our past work (2021), we are able to relate residues of some truncated convolutions of Bernoulli numbers with some Ernvall-Metsänkyla residues to residues of some full convolutions of the same kind. We also establish some congruences concerning other related weighted sums of powers of integers when these sums are weighted by some analogs of the Teichmüller characters.

The Deformation Analysis of the 3D Alignment Control Network Based on the Multiple Congruence Models

In the construction and maintenance of particle accelerators,all the accelerator elements should be installed in the same coordinate system,only in this way could the devices in the actual world be consistent with the design drawings.However,with the occurrence of the movements of the reinforced concrete cover plates at short notice or building deformations in the long term,the control points upon the engineering structure will be displaced,and the fitness between the subnetwork and the global control network may be irresponsible.Therefore,it is necessary to evaluate the deformations of the 3D alignment control network.Different from the extant investigations,in this paper,to characterize the deformations of the control network,all of the congruent models between the points measured in different epochs have been identified,and the congruence model with the most control points is considered as the primary or fundamental model,the remaining models are recognized as the additional ones.Furthermore,the discrepancies between the primary S-transformation parameters and the additional S-transformation parameters can reflect the relative movements of the additional congruence models.Both the iterative GCT method and the iterative combinatorial theory are proposed to detect multiple congruence models in the control network.Considering the actual work of the alignment,it is essential to identify the competitive models in the monitoring network,which can provide us a hint that,even the fitness between the subnetwork and the global control network is good,there are still deformations which may be ignored.The numerical experiments show that the suggested approaches can describe the deformation of the 3D alignment control network roundly.

Architectures and Algorithms of Generalized Congruence Neural Networks

In this paper a novel class of neural networks called generalized congruence neural networks (GCNN) is proposed. All neurons in the neural networks are activated in the form of congruence. The architectures, learning rules and two algorithms are presented. Simulation results indicate that such network has satisfactory generalization properties near the sample points. Since this kind of neural nets can be easily operated and implemented, it is appropriate to make further research concerning the theory and applications of GCNN.

SOME REMARKS ON (L)-GREEN’S RELATIONS AND STRONGLY RPP SEMIGROUPS

In order to study rpp semigroups, in particular, some special cases, several facts on （l）-Green’s relations and strongly rpp semigroups are given as some remarks.

SOME SUBGROUPS OF THE EXTENDED HECKE GROUPS H^－（λq）

The authors consider the extended Hecke groups H(γq) generated by T(z) = -1 / z, S(z) = -1(z +γq) and R(z) = 1 / z with A, = 2 cos(π/q) for q≥3 an integer. In this paper, the even subgroup He(γq), the second commutator subgroup H''(γq) and the principal congruence subgroups Hp(λq) of the extended Hecke groups .H(γq) are studied. Also, relations between them are given.

The Effect of Emotional Conflict on Attention Allocation: An Event-Related Potential Study

Attention allocation research frequently focuses on the valence of emotion. However, there is increasing evidence to indicate that arousal may be more relevant at some stages of affective processing. The present study employed a combined priming and cue-target paradigm and examined event-related potentials (ERPs) in order to explore the effects of emotional conflict of arousal on attention allocation. The background context of arousal was manipulated (using photos of facial expressions) while subjects performed a cognitive task in which a central arrow cue indicated the location of a peripheric target square, and a response was made according to the direction of the square. There was no main effect between incongruent emotion and congruent emotion in the response time, which means the resolution of the emotional conflict facilitate the participant behavioral response. There was a main effect of different emotional states on ERP component. In the present study, incongruent arousal also triggered greater positive potential compared with congruent arousal.

An Algebra of Fuzzy (<i>m</i>, <i>n</i>)-Semihyperrings

We propose a new class of algebraic structure named as (m, n)-semihyperring which is a generalization of usual semihyperring. We define the basic properties of (m, n)-semihyperring like identity elements, weak distributive (m, n)-semihyperring, zero sum free, additively idempotent, hyperideals, homomorphism, inclusion homomorphism, congruence relation, quotient (m, n)-semihyperring etc. We propose some lemmas and theorems on homomorphism, congruence relation, quotient (m, n)-semihyperring, etc. and prove these theorems. We further extend it to introduce the relationship between fuzzy sets and (m, n)-semihyperrings and propose fuzzy hyperideals and homomorphism theorems on fuzzy (m, n)-semihyperrings and the relationship between fuzzy (m, n)-semihyperrings and the usual (m, n)-semihyper-rings.

Phylogenetic definitions for 25 higher-level clade names of birds

Knowledge of the higher-level phylogenetic relationships of birds has grown substantially during the past two decades due to the application of genomic data.However,the nomenclature of higher-level taxa has not become more stable,due to the lack of regulation of taxon names above the level of superfamily by the ICZN,and the usage of rank-based nomenclature,which is not tied to clades in a phylogeny.Lack of regulation and the instability of rank-based nomenclature impede effective communication among systematists.We review support for higher-level avian clades using a set of 10 phylogenomic data sets,and identify clades that are supported by congruency of at least four of these.We provide formal definitions of the names of these clades based on the rules of the recently published PhyloCode.The names of 25 clades are here defined using minimum-crown-clade(n=23),minimum-clade(n=1)and maximum-crown-clade(n=1)definitions.Five new names are introduced here:Dinocrypturi,Pteroclimesites,Musophagotides,Phaethoquornithes and Pelecanes.We also review diagnostic apomorphies of the relevant clades,and identify known synonyms and homonyms.By establishing a formal link between higher-level taxon names and well-supported phylogenetic hypotheses,our phylogenetic definitions will provide a solid basis for the stabilization of avian higher-level nomenclature.

Dynamic analysis of redesigned systems using algebraic method

This study investigates the redesign of a structural system with the matrix modification. The inertia congruence transformation is adopted to find the latent roots of a dynamic stiffness matrix, and a method for determining its eigenvalue is proposed. The characteristics of the latent vector for a known latent root and a method for computing it are studied. The mode shapes of the redesigned structure must be differently handled based on whether the structure exhibits persistent or non-persistent natural frequencies.

Stonean Kernels of MS-algebras

In this paper, the internal structures of MS-algebras are investigated by means of the new notions of Stonean kernel and M-ideal. We determine necessary and sufficient conditions for an MS-algebra with a Kleene skeleton. After introducing a special kind of principal congruence, we consider the relationship between an MS-algebra and its quotient algebra.

REESSE Unified Recursive Algorithm for Solving Three Computational Problems

Different from the extended Euclidean algorithm which can compute directly only the multiplicative inverse of an element in Zm^＊ and the greatest common divisor of two integers, a recursive algorithm called REESSE is designed by the authors, which can not only seek directly the multiplicative inverse and the greatest common divisor, but also solve directly a simple congruence for general solutions. This paper presents the definition and the two valuable properties of a simple congruence, analyzes in detail the reduction and recursion process of solving simple congruences, induces the recursive formula for solving simple congruences, and describes formally and implements in C language the recursive algorithm. At last, the paper compares REESSE with the extended Euclidean algorithm in thought, applicability and time complexity.