English
Related papers

Related papers: Abelian groups yield many large families for the d…

200 papers

Fix a poset $P$ and a natural number $n$. For various commutative local rings $\Lambda$, each of Loewy length $n$, consider the category $\textrm{sub}_\Lambda P$ of $\Lambda$-linear submodule representations of $P$. We give a criterion for…

Representation Theory · Mathematics 2019-06-27 Markus Schmidmeier

We study sum-free sets in sparse random subsets of even order abelian groups. In particular, we determine the sharp threshold for the following property: the largest such set is contained in some maximum-size sum-free subset of the group.…

Combinatorics · Mathematics 2015-06-03 Neal Bushaw , Maurício Collares Neto , Robert Morris , Paul Smith

We propose and study a variation of the classical isomorphism problem for group rings in the context of projective representations. We formulate several weaker conditions following from our notion and give all logical connections between…

Rings and Algebras · Mathematics 2025-10-23 Leo Margolis , Ofir Schnabel

We show that it is undecidable whether a system of linear equations over the Laurent polynomial ring $\mathbb{Z}[X^{\pm}]$ admit solutions where a specified subset of variables take value in the set of monomials $\{X^z \mid z \in…

Symbolic Computation · Computer Science 2024-09-09 Ruiwen Dong

We give a new proof that there are arbitrarily large indecomposable abelian groups; moreover, the groups constructed are absolutely indecomposable, that is, they remain indecomposable in any generic extension. However, any absolutely rigid…

Logic · Mathematics 2007-05-23 Paul C. Eklof , Saharon Shelah

In this paper, we exhibit an $\textsf{AC}^{3}$ isomorphism test for groups without Abelian normal subgroups (a.k.a. Fitting-free groups), a class for which isomorphism testing was previously known to be in $\mathsf{P}$ (Babai, Codenotti,…

Computational Complexity · Computer Science 2025-04-29 Joshua A. Grochow , Dan Johnson , Michael Levet

We show that elementary abelian direct factors can be disregarded in the study of the modular isomorphism problem. Moreover, we obtain four new series of abelian invariants of the group base in the modular group algebra of a finite…

Rings and Algebras · Mathematics 2023-09-25 Leo Margolis , Taro Sakurai , Mima Stanojkovski

A family $\mathcal{A}$ of sets is said to be \emph{$t$-intersecting} if any two sets in $\mathcal{A}$ have at least $t$ common elements. A central problem in extremal set theory is to determine the size or structure of a largest…

Combinatorics · Mathematics 2011-07-01 Peter Borg

We investigate the dynamics of semigroups generated by a family of polynomial maps on the Riemann sphere such that the postcritical set in the complex plane is bounded. Moreover, we investigate the associated random dynamics of polynomials.…

Dynamical Systems · Mathematics 2007-11-26 Hiroki Sumi

In the present paper, we introduce a new concept of convexity which is generated by a family of endomorphisms of an Abelian group. In Abelian groups equipped with a translation invariant metric, we define the boundedness, the norm, the…

Metric Geometry · Mathematics 2020-11-23 Włodzimierz Fechner , Zsolt Páles

We generalize the hierarchy construction to generic 2+1D topological orders (which can be non-Abelian) by condensing Abelian anyons in one topological order to construct a new one. We show that such construction is reversible and leads to a…

Strongly Correlated Electrons · Physics 2017-08-08 Tian Lan , Xiao-Gang Wen

In this paper we propose a conjecture concerning partial sums of an arbitrary finite subset of an abelian group, that naturally arises investigating simple Heffter systems. Then, we show its connection with related open problems and we…

Combinatorics · Mathematics 2017-06-15 Simone Costa , Fiorenza Morini , Anita Pasotti , Marco Antonio Pellegrini

We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can attain. We first…

Combinatorics · Mathematics 2020-06-05 C. Dalfó , M. A. Fiol , N. López , J. Ryan

We construct an embedding G of the category of graphs into the category of abelian groups such that for graphs X and Y we have Hom(GX,GY)=Z[Hom(X,Y)], the free abelian group whose basis is the set Hom(X,Y). The isomorphism is functorial in…

Category Theory · Mathematics 2014-03-20 Adam J. Przezdziecki

We show that, for any given subgroup $H$ of a finite group $G$, the Quillen poset $\mathcal{A}_p(G)$ of nontrivial elementary abelian $p$-subgroups, is obtained from $\mathcal{A}_p(H)$ by attaching elements via their centralizers in $H$. We…

Group Theory · Mathematics 2020-11-17 Kevin Ivan Piterman

Strongly dependent ordered abelian groups have finite dp-rank. They are precisely those groups with finite spines and $|\{p\text{ prime}:[G:pG]=\infty\}|<\infty$. We apply this to show that if $K$ is a strongly dependent field, then $(K,v)$…

Logic · Mathematics 2024-04-09 Yatir Halevi , Assaf Hasson

In the area of forbidden subposet problems we look for the largest possible size $La(n,P)$ of a family $\mathcal{F}\subseteq 2^{[n]}$ that does not contain a forbidden inclusion pattern described by $P$. The main conjecture of the area…

Combinatorics · Mathematics 2020-07-15 Dániel Gerbner , Dániel Nagy , Balázs Patkós , Máté Vizer

We consider decidability problems in self-similar semigroups, and in particular in semigroups of automatic transformations of $X^*$. We describe algorithms answering the word problem, and bound its complexity under some additional…

Group Theory · Mathematics 2017-05-19 Laurent Bartholdi

We find new constructions of infinite families of skew Hadamard difference sets in elementary abelian groups under the assumption of the existence of cyclotomic strongly regular graphs. Our construction is based on choosing cyclotomic…

Combinatorics · Mathematics 2012-08-29 Koji Momihara

Let $G=(V,E)$ be a graph. A subset $D\subseteq V$ is a dominating set if every vertex not in $D$ is adjacent to a vertex in $D$. A dominating set $D$ is called a total dominating set if every vertex in $D$ is adjacent to a vertex in $D$.…

Combinatorics · Mathematics 2011-09-09 Fu-Tao Hu , Jun-Ming Xu