English
Related papers

Related papers: Necklaces over a group with identity product

200 papers

A finite sampling theory associated with a unitary representation of a finite non Abelian group $\mathbf{G}$ on a Hilbert space is stablished. The non Abelian group $\mathbf{G}$ is a knit product $\mathbf{N}\bowtie \mathbf{H}$ of two finite…

Functional Analysis · Mathematics 2018-07-02 Antonio G. García , Miguel A. Hernández-Medina , Albert Ibort

We study some sum-product problems over matrix rings. Firstly, for $A, B, C\subseteq M_n(\mathbb{F}_q)$, we have $$ |A+BC|\gtrsim q^{n^2}, $$ whenever $|A||B||C|\gtrsim q^{3n^2-\frac{n+1}{2}}$. Secondly, if a set $A$ in $M_n(\mathbb{F}_q)$…

Combinatorics · Mathematics 2022-06-14 Chengfei Xie , Gennian Ge

We consider the classical pretzel knots $P(a_1, a_2, a_3)$, where $a_1, a_2, a_3$ are positive odd integers. By using continuous paths of elliptic $\mathrm{SL}_2(\mathbb R)$-representations, we show that (i) the 3-manifold obtained by…

Geometric Topology · Mathematics 2020-11-18 Arafat Khan , Anh T. Tran

In this paper we study the conjugacy problem in polycyclic groups. Our main result is that we construct polycyclic groups $G_n$ whose conjugacy problem is at least as hard as the subset sum problem with $n$ indeterminates. As such, the…

Group Theory · Mathematics 2014-10-21 Bren Cavallo , Delaram Kahrobaei

Let $G$ be a finite group and exp$(G)$ = lcm$\{$ord$(g)$$\mid$$g \in G \}$. A finite unordered sequence of terms from $G$, where repetition is allowed, is a product-one sequence if its terms can be ordered such that their product equals the…

Combinatorics · Mathematics 2019-08-13 Jun Seok Oh , Qinghai Zhong

We introduce a collection of polynomials $F_N$, associated to each positive integer $N$, whose divisibility properties yield a reformulation of the Goldbach conjecture. While this reformulation certainly does not lead to a resolution of the…

Number Theory · Mathematics 2014-08-22 Peter B. Borwein , Stephen K. K. Choi , Greg Martin , Charles L. Samuels

We consider the problem of constructing a cyclic listing of all bitstrings of length $2n+1$ with Hamming weights in the interval $[n+1-\ell,n+\ell]$, where $1\leq \ell\leq n+1$, by flipping a single bit in each step. This is a far-ranging…

Combinatorics · Mathematics 2022-08-23 Petr Gregor , Sven Jäger , Torsten Mütze , Joe Sawada , Kaja Wille

Let $q$ be an odd prime, $m$ a positive integer, and let $\Ga_m(q)$ be the group generated by two elements $x$ and $y$ subject to the relations $x^{2m}=y^{qm}=1$ and $x^2=y^q$; that is, $\Ga_m(q)$ is the free product of two cyclic groups of…

Group Theory · Mathematics 2008-12-23 Christian Krattenthaler , Thomas W. Müller

The enumeration of perfect matchings of graphs is equivalent to the dimer problem which has applications in statistical physics. A graph $G$ is said to be $n$-rotation symmetric if the cyclic group of order $n$ is a subgroup of the…

Combinatorics · Mathematics 2007-05-23 Weigen Yan , Yeong-Nan Yeh , Fuji Zhang

Fix a finite group $G$. We study the computational complexity of counting problems of the following flavor: given a group $\Gamma$, count the number of homomorphisms $\Gamma \to G$. Our first result establishes that this problem is…

Group Theory · Mathematics 2026-04-22 Eric Samperton , Armin Weiß

Brawley and Carlitz introduced diamond products of elements of finite fields and associated composed products of polynomials in 1987. Composed products yield a method to construct irreducible polynomials of large composite degrees from…

Number Theory · Mathematics 2024-02-23 Lukas Kölsch , Lucas Krompholz , Gohar M. Kyureghyan

I present a bijection on integer partitions that leads to recursive expressions, closed formulae and generating functions for the cardinality of certain sets of partitions of a positive integer $n$. The bijection leads also to a product on…

Combinatorics · Mathematics 2009-06-17 Alain Goupil

We introduce a new invariant of tangles along with an algebraic framework in which to understand it. We claim that the invariant contains the classical Alexander polynomial of knots and its multivariable extension to links. We argue that of…

Quantum Algebra · Mathematics 2013-09-16 Dror Bar-Natan , Sam Selmani

We study the topdrop map, a mapping on permutations in $S_n$ related to card shuffling. We show this map is bijective and study its orbit structure. We introduce the notion of the topdrop-necklace as a way of classifying the orbits of the…

Combinatorics · Mathematics 2025-10-21 Nathan R. Krause

We consider random walk polynomial sequences $(P_n(x))_{n\in\mathbb{N}_0}\subseteq\mathbb{R}[x]$ given by recurrence relations of the form $P_0(x)=1$, $P_1(x)=x$ and $x P_n(x)=a_n P_{n+1}(x)+c_n P_{n-1}(x)\;(n\in\mathbb{N})$, where $a_n$…

Classical Analysis and ODEs · Mathematics 2026-03-19 Stefan Kahler , Josef Obermaier

According to seminal work of Kontsevich, the unstable homology of the mapping class group of a surface can be computed via the homology of a certain lie algebra. In a recent paper, S. Morita analyzed the abelianization of this lie algebra,…

Quantum Algebra · Mathematics 2010-08-25 James Conant

Suppose $C(G)$ denotes the set of all cyclic subgroups of a finite group $G$, and $\mathcal{O}_{2}(G)$ denotes the number of elements of order $2$ in $G$. In [Marius T., Finite groups with a certain number of cyclic subgroups. The American…

Group Theory · Mathematics 2025-08-08 Vaibhav Chhajer , Sumana Hatui , Palash Sharma

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot\ldots\cdot(n_lg)$ where $g\in G$ and $n_1, \ldots, n_l\in[1, \ord(g)]$, and the index $\ind(S)$ of $S$ is defined to be the minimum of…

Number Theory · Mathematics 2014-02-04 Caixia Shen , Li-meng Xia , Yuanlin Li

We present a proof of Swee Hong Chan's conjecture establishing a bijection between the set of necklaces of length $n$ with at most $q$ colors, and the set of periodic functions $f: \mathbb{Z}_{n}\to {0, 1, ..., q-1}$ whose weighted sum is…

Combinatorics · Mathematics 2025-09-03 Jiyou Li , Yanghongbo Zhou

Much progress has been made on the problem of calculating $g(n)$ for various classes of integers $n$, where $g$ is the group-counting function. We approach the inverse problem of solving the equations $g(n) = 6$ and $g(n) = 7$ in $n$. The…

Group Theory · Mathematics 2024-05-09 Aban S. Mahmoud