English
Related papers

Related papers: Infinitely many groups exhibiting intermediate gro…

200 papers

Abelian codes and complementary dual codes form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, a family of abelian codes with complementary…

Information Theory · Computer Science 2017-10-16 Arunwan Boripan , Somphong Jitman , Patanee Udomkavanich

Let $G$ be a finite abelian group and $s$ be a positive integer. A subset $A$ of $G$ is called a {\em perfect $s$-basis of $G$} if each element of $G$ can be written uniquely as the sum of at most $s$ (not-necessarily-distinct) elements of…

Number Theory · Mathematics 2022-11-28 Bela Bajnok , Connor Berson , Hoang Anh Just

In this paper we discuss some of the key properties of sum-free subsets of abelian groups. Our discussion has been designed with a broader readership in mind, and is hence not overly technical. We consider answers to questions like: how…

Combinatorics · Mathematics 2023-03-28 Renato Cordeiro de Amorim

Let $G$ be an abelian group, let $S$ be a sequence of terms $s_1,s_2,...,s_{n}\in G$ not all contained in a coset of a proper subgroup of $G$, and let $W$ be a sequence of $n$ consecutive integers. Let $$W\odot S=\{w_1s_1+...+w_ns_n:\;w_i…

Number Theory · Mathematics 2011-06-29 David J. Grynkiewicz , Andreas Philipp , Vadim Ponomarenko

Let G be an arbitrary Abelian group and let A be a finite subset of G. A has small additive doubling if |A+A| < K|A| for some K>0. These sets were studied in papers of G.A. Freiman, Y. Bilu, I. Ruzsa, M.C.--Chang, B. Green and T.Tao. In the…

Number Theory · Mathematics 2007-05-23 I. D. Shkredov

For a graph $G=(V,E)$, let $\tau(G)$ denote the minimum number of pairwise edge disjoint complete bipartite subgraphs of $G$ so that each edge of $G$ belongs to exactly one of them. It is easy to see that for every graph $G$, $\tau(G) \leq…

Combinatorics · Mathematics 2014-02-27 Noga Alon

The following natural problem was raised independently by Erd\H{o}s-Hajnal and Linial-Rabinovich in the late 80's. How large must the independence number $\alpha(G)$ of a graph $G$ be whose every $m$ vertices contain an independent set of…

Combinatorics · Mathematics 2023-01-18 Matija Bucić , Benny Sudakov

A central problem in extremal graph theory is to estimate, for a given graph $H$, the number of $H$-free graphs on a given set of $n$ vertices. In the case when $H$ is not bipartite, fairly precise estimates on this number are known. In…

Combinatorics · Mathematics 2017-10-13 Asaf Ferber , Gweneth Anne McKinley , Wojciech Samotij

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

Group Theory · Mathematics 2023-09-29 Nikolay Nikolov

Let $\alpha'$ and $\mu_i$ denote the matching number of a non-empty simple graph $G$ with $n$ vertices and the $i$-th smallest eigenvalue of its Laplacian matrix, respectively. In this paper, we prove a tight lower bound $$\alpha' \ge…

Combinatorics · Mathematics 2021-11-16 Xiaofeng Gu , Muhuo Liu

An $integral$ of a group $G$ is a group $H$ whose derived group (commutator subgroup) is isomorphic to $G$. This paper discusses integrals of groups, and in particular questions about which groups have integrals and how big or small those…

Group Theory · Mathematics 2018-08-24 João Araújo , Peter J. Cameron , Carlo Casolo , Francesco Matucci

For a prime $p \equiv 2 \pmod 3$, it is well known that the largest sum-free subsets of $\mathbb{F}_p^n$ have size $\frac{p+1}{3} p^{n-1}$, and the extremal sets must be a cuboid of the form $\{\frac{p+1}{3}, \frac{p+1}{3}+1, \ldots,…

Combinatorics · Mathematics 2025-12-30 Xin Wei , Xiande Zhang , Gennian Ge

Write ${\cal I}(G)$ for the set of independent sets of a graph $G$ and $i(G)$ for $|{\cal I}(G)|$. It has been conjectured (by Alon and Kahn) that for an $N$-vertex, $d$-regular graph $G$, $$ i(G) \leq \left(2^{d+1}-1\right)^{N/2d}. $$ If…

Combinatorics · Mathematics 2010-07-29 David Galvin

Let $G$ be a simple graph with a perfect matching. Deng and Zhang showed that the maximum anti-forcing number of $G$ is no more than the cyclomatic number. In this paper, we get a novel upper bound on the maximum anti-forcing number of $G$…

Combinatorics · Mathematics 2023-06-22 Lingjuan Shi , Heping Zhang

We show that if $G$ is a finite Abelian group and $f$ is an integer-valued map on $G$ with algebra norm at most $M$ then there is some $L < \exp(M^{4+o(1)})$, cosets of (possibly different) subgroups $W_1,...,W_L$, and $s_1,...,s_L \in…

Classical Analysis and ODEs · Mathematics 2020-08-18 Tom Sanders

Let $G=(V,E)$ be a graph on $n$ vertices, and let $\lambda_1(L(G))\ge \cdots\ge \lambda_{n-1}(L(G))\ge \lambda_n(L(G))=0$ be the eigenvalues of its Laplacian matrix $L(G)$. Brouwer conjectured that for every $1\le k\le n$, $\sum_{i=1}^k…

Combinatorics · Mathematics 2024-10-08 Alan Lew

In 2022, using methods from ergodic theory, Kra, Moreira, Richter, and Robertson resolved a longstanding conjecture of Erd\H{o}s about sumsets in large subsets of the natural numbers. In this paper, we extend this result to several…

Dynamical Systems · Mathematics 2025-01-29 Dimitrios Charamaras , Andreas Mountakis

Let $G$ be a finite $p$-group of order $p^n$. YA. G. Berkovich (Journal of Algebra {\bf 144}, 269-272 (1991)) proved that $G$ is elementary abelian $p$-group if and only if the order of its Schur multiplier, $M(G)$, is at the maximum case.…

Group Theory · Mathematics 2011-03-31 Behrooz Mashayekhy , Mahboobeh Alizadeh Sanati

Suppose $G$ is a $\mathcal{T}$-group (finitely generated torsion-free nilpotent) with centralizers outside of the derived subgroup being abelian of rank equal to $\text{rank}(Z_1)+1$. This includes the class of free nilpotent groups…

Group Theory · Mathematics 2024-09-25 Adam Moubarak

Let $G$ be a finite abelian group of order $n$, and for each $a\in G$ and integer $1\le h\le n$ let $\mathcal{F}_a(h)$ denote the family of all $h$-element subsets of $G$ whose sum is $a$. A problem posed by Katona and Makar-Limanov is to…

Combinatorics · Mathematics 2025-09-11 Jing Wang
‹ Prev 1 8 9 10 Next ›