相关论文: The symmetry of intersection numbers in group theo…

We derive various inequalities involving the intersection number of the curves contained in geodesics and tight geodesics in the curve graph. While there already exist such inequalities on tight geodesics, our method applies in the setting…

We present the concept of the topological symmetry group as a way to analyze the symmetries of non-rigid molecules. Then we characterize all of the groups which can occur as the topological symmetry group of an embedding of the complete…

In this paper we continue our investigation of the global categorical symmetries that arise when gauging finite higher groups and their higher subgroups with discrete torsion. The motivation is to provide a common perspective on the…

Symmetric cohomology of groups, defined by M. Staic in [2], is similar to the way one defines the cyclic cohomology for algebras. We show that there is a well-defined restriction, conjugation and transfer map in symmetric cohomology, which…

In this paper we define a new algebraic object: the disguised-groups. We show the main properties of the disguised-groups and, as a consequence, we will see that disguised-groups coincide with regular semigroups. We prove many of the…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

The harmonious chromatic number of a graph $G$ is the minimum number of colors that can be assigned to the vertices of $G$ in a proper way such that any two distinct edges have different color pairs. This paper gives various results on…

Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups…

Identifying symmetries in data sets is generally difficult, but knowledge about them is crucial for efficient data handling. Here we present a method how neural networks can be used to identify symmetries. We make extensive use of the…

We derive a formula connecting the orders of the automorphism groups of a finite group and of its covering groups.

This is the second in a series of papers. Here we develop here an intersection theory for manifolds equipped with an action of a finite group. As in our previous paper, our approach will be homotopy theoretic, enabling us to circumvent the…

It is an interesting and open problem to trace the origin of the pseudospin symmetry in nuclear single-particle spectra and its symmetry breaking mechanism in actual nuclei. In this report, we mainly focus on our recent progress on this…

On a smooth variety, Serre's intersection formula computes intersection multiplicities via an alternating sum of the lengths of Tor groups. When the variety is singular, the corresponding sum can be a divergent series. But there are…

With every matching in a graph we associate a group called the matching group. We study this group using the theory of non-positively curved cubed complexes. Our approach is formulated in terms of so-called gliding systems.

A rational group of hermitian type is an algebraic group over the rational numbers whose symmetric space is a hermitian symmetric space. We assume such a group $G$ to be given, which we assume is isotropic. Then, for any rational parabolic…

It was shown that in a group of bijections of an infinite set some families of subsets, related to the cardinality of some eigenspaces, are generating. Besides, we derived a criterion for generating by sets of this kind.

The {\it prime graph} $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of $G$ of order…

Critical points of an invariant function may or may not be symmetric. We prove, however, that if a symmetric critical point exists, those adjacent to it are generically symmetry breaking. This mathematical mechanism is shown to carry…

We consider symmetric (not complete intersection) numerical semigroups S_6, generated by a set of six positive integers {d_1,...,d_6}, gcd(d_1,...,d_6)=1, and derive inequalities for degrees of syzygies of such semigroups and find the lower…

In this paper, we obtain some new results on closed subschemes. Specially, we define natural addition and multiplication on the closed subschemes of a scheme. It is shown that "the multiplication" precisely coincides with the well known…