English
Related papers

Related papers: Zero sum partition into sets of the same order and…

200 papers

The following problem has been known since the 80s. Let $\Gamma$ be an Abelian group of order $m$ (denoted $|\Gamma|=m$), and let $t$ and $\{m_i\}_{i=1}^{t}$, be positive integers such that $\sum_{i=1}^t m_i=m-1$. Determine when…

Combinatorics · Mathematics 2024-10-30 Sylwia Cichacz , Karol Suchan

The following problem has been known since the 80's. Let $\Gamma$ be an Abelian group of order $m$ (denoted $|\Gamma|=m$), and let $t$ and $m_i$, $1 \leq i \leq t$, be positive integers such that $\sum_{i=1}^t m_i=m-1$. Determine when…

Combinatorics · Mathematics 2023-06-22 Sylwia Cichacz , Karol Suchan

A complete mapping of a group $\Gamma$ is a bijection $\varphi\colon \Gamma\to \Gamma$ for which the mapping $x \mapsto x+\varphi(x)$ is a bijection. In this paper we consider the existence of a complete mapping $\varphi$ of $\Gamma$ and a…

Combinatorics · Mathematics 2025-03-04 Sylwia Cichacz

We provide a summary of research on disjoint zero-sum subsets in finite Abelian groups, which is a branch of additive group theory and combinatorial number theory. An orthomorphism of a group $\Gamma$ is defined as a bijection $\varphi$…

Combinatorics · Mathematics 2024-10-30 Sylwia Cichacz

A $\Gamma$-distance magic labeling of a graph $G=(V,E)$ with $|V | = n$ is a bijection $\ell$ from $V$ to an Abelian group $\Gamma$ of order $n$ such that the weight $w(x)=\sum_{y\in N_G(x)}\ell(y)$ of every vertex $x \in V$ is equal to the…

Combinatorics · Mathematics 2017-12-04 Sylwia Cichacz

Let $G=(V,E)$ be a graph and $\Gamma $ an Abelian group both of order $n$. A $\Gamma$-distance magic labeling of $G$ is a bijection $\ell \colon V\rightarrow \Gamma $ for which there exists $\mu \in \Gamma $ such that $% \sum_{x\in…

Combinatorics · Mathematics 2021-09-06 Sylwia Cichacz , Dalibor Froncek , Paweł Dyrlaga

In this paper we study sum-free sets of order $m$ in finite Abelian groups. We prove a general theorem on 3-uniform hypergraphs, which allows us to deduce structural results in the sparse setting from stability results in the dense setting.…

Combinatorics · Mathematics 2012-02-01 Noga Alon , József Balogh , Robert Morris , Wojciech Samotij

Let $\overrightarrow{G}$ be a directed graph with no component of orderless than~$3$, and let $\Gamma$ be a finite Abelian group such that $|\Gamma|\geq 4|V(\overrightarrow{G})|$ or if $|V(\overrightarrow{G})|$ is large enough with respect…

Combinatorics · Mathematics 2022-01-24 Sylwia Cichacz , Zsolt Tuza

A $\Gamma$\emph{-distance magic labeling} of a graph $G = (V, E)$ with $|V| = n$ is a bijection $\ell$ from $V$ to an Abelian group $\Gamma$ of order $n$, for which there exists $\mu \in \Gamma$, such that the weight $w(x) =\sum_{y\in…

Combinatorics · Mathematics 2025-12-30 Sylwia Cichacz , Štefko Miklavič

In this paper, we prove that for all $m\geq 1$ and $n=1$, the graph $ m\Gamma(\mathbb{Z}_9)+n\Gamma(\mathbb{Z}_4)$, for all $n\geq 1$, and $m=1$, the graph $m\overline{\Gamma(\mathbb{Z}_6)}+n\Gamma(\mathbb{Z}_9)$, for all $m\geq1$,…

Combinatorics · Mathematics 2024-07-12 V. Sivakumaran , K. Sankar , S. Prabhu

This paper is an endeavor to discuss some properties of zero-divisor graphs of the ring $\mathbb{Z}_n$, the ring of integers modulo $n$. The zero divisor graph of a commutative ring $R$, is an undirected graph whose vertices are the nonzero…

Combinatorics · Mathematics 2020-10-05 Amrita Acharyya , Robinson Czajkowski

A $\Gamma$-distance magic labeling of a graph $G=(V,E)$ with $|V | = n$ is a bijection $f$ from $V$ to an Abelian group $\Gamma$ of order $n$ such that the weight $w(x)=\sum_{y\in N_G(x)}f(y)$ of every vertex $x \in V$ is equal to the same…

Combinatorics · Mathematics 2017-12-04 Sylwia Cichacz

Let $\Gamma$ be an Abelian group. In this paper I characterize the $A$-paths of weight $0\in\Gamma$ that have the Erd\H{o}s-P\'osa property. Using this in an auxiliary graph, one can also easily characterize the $A$-paths of weight…

Combinatorics · Mathematics 2020-10-05 Arthur Ulmer

It is well-known that a finitely generated group $\Gamma$ has Kazhdan's property (T) if and only if the Laplacian element $\Delta$ in ${\mathbb R}[\Gamma]$ has a spectral gap. In this paper, we prove that this phenomenon is witnessed in…

Group Theory · Mathematics 2015-12-02 Narutaka Ozawa

A function $f$ from an Abelian group $(A,+)$ to an Abelian group $(B,+)$ is $(n, m, S)$ zero-difference (ZD), if $S=\{\lambda_\alpha \mid \alpha \in A\setminus\{0\}\}$ where $n=|A|$, $m=|f(A)|$ and $\lambda_\alpha=|\{x \in A \mid…

Combinatorics · Mathematics 2026-01-01 Zongxiang Yi , Dingyi Pei , ChunmingTang

We prove that a C$^*$-algebra $A$ has uniform property $\Gamma$ if the set of extremal tracial states, $\partial_e T(A)$, is a non-empty compact space of finite covering dimension and for each $\tau \in \partial_e T(A)$, the von Neumann…

Operator Algebras · Mathematics 2024-11-27 Samuel Evington , Christopher Schafhauser

In this article, we determine, given a finite graph $\Gamma$ and an integer $n \geq 1$, when a right-angled Artin group $A(\Gamma)$ virtually splits over an abelian subgroup of rank $n$. More precisely, we show that the following assertions…

Group Theory · Mathematics 2026-04-01 Oussama Bensaid , Anthony Genevois , Romain Tessera

The Zero divisor Graph of a commutative ring $R$, denoted by $\Gamma[R]$, is a graph whose vertices are non-zero zero divisors of $R$ and two vertices are adjacent if their product is zero. In this paper, we consider the zero divisor graph…

Rings and Algebras · Mathematics 2017-07-18 B. Surendranath Reddy , Rupali. S. Jain , N. Laxmikanth

Let $G=\Gamma(S)$ be a semigroup graph, i.e., a zero-divisor graph of a semigroup $S$ with zero element 0. For any adjacent vertices $x, y$ in $G$, denote $C(x,y)={z\in V(G) | N(z)={x,y}}$. Assume that in $G$ there exist two adjacent…

Rings and Algebras · Mathematics 2018-04-24 Li Chen , Tongsuo Wu

Let $\alpha=\{a_1,a_2,a_3,...,a_n\}$ be a set of elements, $\delta < n$ be a non-negative integer, and $\Gamma: \alpha \to \{0, 1, 2, ..., n\}$ be a total mapping. Then, we call $\Gamma$ a \emph{partition} of $\alpha$ if and only if for all…

Data Structures and Algorithms · Computer Science 2021-02-04 Samer Nofal
‹ Prev 1 2 3 10 Next ›