相关论文: The Formal Context of Saturated Transfer Systems o…

For a finite group $G$, the notion of a $G$-transfer system provides homotopy theorists with a combinatorial way to study equivariant objects. In this paper, we focus on the properties of transfer systems for non-abelian groups. We…

We prove that Hill's characteristic function $\chi$ for transfer systems on a lattice $P$ surjects onto interior operators for $P$. Moreover, the fibers of $\chi$ have unique maxima which are exactly the saturated transfer systems. In order…

Formal Concept Analysis makes the fundamental observation that any finite lattice $(L, \leq)$ is determined up to isomorphism by the restriction of the relation ${\leq} \subseteq L \times L$ to the set $J(L) \times M(L)$, where $J(L)$ is…

Transfer systems are combinatorial objects which classify $N_\infty$ operads up to homotopy. By results of A. Blumberg and M. Hill, every transfer system associated to a linear isometries operad is also saturated (closed under a particular…

We consider the lattice of all the weak factorization systems on a given finite lattice. We prove that it is semidistributive, trim and congruence uniform. We deduce a graph theoretical approach to the problem of enumerating transfer…

This paper deals with the number of subgroups of a given exponent in a finite abelian group. Explicit formulas are obtained in the case of rank two and rank three abelian groups. An asymptotic formula is also presented.

Finite (or Discrete) Fourier Transforms (FFT) are essential tools in engineering disciplines based on signal transmission, which is the case in most of them. FFT are related with circulant matrices, which can be viewed as group matrices of…

For a finite group $G$, $G$-transfer systems are combinatorial objects which encode the homotopy category of $G$-$N_\infty$ operads, whose algebras in $G$-spectra are $E_\infty$ $G$-spectra with a specified collection of multiplicative…

For a finite group $G$, $N_\infty$ operads encode collections of norm maps, and by work of Blumberg--Hill and Rubin their homotopy category is equivalent to the poset of $G$--transfer systems on the subgroup lattice of $G$. In \cite{ABB+25}…

In this short note we give a formula for the number of chains of subgroups of a finite elementary abelian $p$-group. This completes our previous work [5].

We study completely syndetic (CS) sets in discrete groups - subsets that for every natural n admit finitely many left translates that jointly cover every n-tuple of group elements. While for finitely-generated groups, the non-virtually…

In the present paper we introduce and study a canonical ${\cal E}$-lattice structure on the set of element orders of some finite groups. We show that a finite abelian group is uniquely determined by this canonical ${\cal E}$-lattice.

We investigate the saturation rank of a finite group scheme, defined over an algebraically closed field $\Bk$ of positive characteristic $p$. We begin by exploring the saturation rank for finite groups and infinitesimal group schemes.…

The main goal of the current paper is to determine the total number of diamonds in the subgroup lattice of a finite abelian group. This counting problem is reduced to finite $p$-groups. Explicit formulas are obtained in some particular…

Transfer systems on finite posets have recently been gaining traction as a key ingredient in equivariant homotopy theory. Additionally, they also naturally occur in the data of a model structure. We give a complete characterization of all…

We study certain lattices constructed from finite abelian groups. We show that such a lattice is eutactic, thereby confirming a conjecture by B\"ottcher, Eisenbarth, Fukshansky, Garcia, Maharaj. Our methods also yield simpler proofs of two…

We study the question how many subgroups, cosets or subspaces are needed to cover a finite Abelian group or a vector space if we have some natural restrictions on the structure of the covering system. For example we determine, how many…

Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed…

The main goal of this paper is to apply the arithmetic method developed in our previous paper \cite{13} to determine the number of some types of subgroups of finite abelian groups.

This paper describes problems concerning the range of cardinalities of sumsets and restricted sumsets of finite subsets of the integers and finite subsets of ordered abelian groups.