相关论文: Results and questions on matchings in groups and v…

We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…

It is well known that over an infinite field the ring of symmetric functions in a finite number of variables is isomorphic to the one of polynomial functions on matrices that are invariants by the action of conjugation by general linear…

The cyclic sieving phenomenon is a well-studied occurrence in combinatorics appearing when a cyclic group acts on a finite set. In this paper, we demonstrate a natural extension of this theory to finite abelian groups. We also present a…

We study the homology of simplicial and cubical sets with symmetries. These are simplicial and cubical sets with additional maps expressing the symmetries of simplices and cubes. We consider the chain complex computing the homology groups…

We study the arithmetic aspects of the finite group of extensions of abelian varieties defined over a number field. In particular, we establish relations with special values of L-functions and congruences between modular forms.

Our paper deals with the investigation of extensions of commutative groups by loops so that the quasigroups that result in the multiplication between cosets of the kernel subgroup are T-quasigroups. We limit our study to extensions in which…

Let G be a group. The intersection graph G(G) of G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper nontrivial subgroups of G; and there is an edge between two distinct…

For a finite abelian group $G$ with subsets $A$ and $B$, the sumset $AB$ is $\{ab \mid a\in A, b \in B\}$. A fundamental problem in additive combinatorics is to find a lower bound for the cardinality of $AB$ in terms of the cardinalities of…

The purpose of this paper is to show that the reflex fields of a given CM-field is equipped with a certain combinatorial structure that has not been exploited yet. We prove three theorems using this structure; the first theorem is on the…

We show that labelled Thompson groups and twisted Brin--Thompson groups are all acyclic. This allows us to prove several new embedding results for groups. First, every group of type $F_n$ embeds quasi-isometrically as a subgroup of an…

This article continues a prior investigation of the authors with the goal of extending characterization results of convolutional tight frames from the context of cyclic groups to general finite abelian groups. The collections studied are…

In this paper, we investigate the existence of an elementary abelian closure in characteristic not $2$ for biquadratic extensions. We discover that it exists for any non-cyclic extension. We make use of it to obtain a classification for…

A matching $M$ in a graph $G$ is an \emph{acyclic matching} if the subgraph of $G$ induced by the endpoints of the edges of $M$ is a forest. Given a graph $G$ and a positive integer $\ell$, Acyclic Matching asks whether $G$ has an acyclic…

In a finite abelian group $G$, define an additive matching to be a collection of triples $(x_i, y_i, z_i)$ such that $x_i + y_j + z_k = 0$ if and only if $i = j = k$. In the case that $G = \mathbb{F}_2^n$, Kleinberg, building on work of…

Among abelian extensions of a congruence function field, an asymptotic relation of class number and genus is established. The proof is classical, employing well-known results from congruence function field theory.

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…

The category of matchings between finite sets extends to the category of cobordisms of signed sets. A chain of cobordisms that starts and ends with unsigned sets A and B yields a matching from A to B. This is a convenient way to package the…

The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism…

This paper explores the cohomology of linear cycle sets, focusing on extensions of a specific linear cycle set H by an abelian group I. We derive explicit formulas for the second cohomology group, which classifies these extensions, and…

In this paper, we introduce a new function related to the sum of element orders of finite groups. It is used to give some criteria for a finite group to be cyclic, abelian, nilpotent, supersolvable and solvable, respectively.