English
Related papers

Related papers: Necklaces over a group with identity product

200 papers

The aim of the present note is to construct invariants of the Artin braid group valued in $G_{N}^{2}$, and further study of groups related to $G_{n}^{3}$. In the groups $G_{n}^{2}$, the word problem is solved; these groups are much simpler…

Geometric Topology · Mathematics 2016-12-02 Vassily Olegovich Manturov

Let $G$ be a finite group and $D_{2n}$ be the dihedral group of $2n$ elements. For a positive integer $d$, let $\mathsf{s}_{d\mathbb{N}}(G)$ denote the smallest integer $\ell\in \mathbb{N}_0\cup \{+\infty\}$ such that every sequence $S$…

Combinatorics · Mathematics 2020-04-01 Kevin Zhao

We study general properties of the restriction of the representations of the finite complex reflection groups $G(de,e,r+1)$ to their maximal parabolic subgroups of type $G(de,e,r)$, and focus notably on the multiplicity of components. In…

Representation Theory · Mathematics 2008-08-30 Ivan Marin

We introduce a group naturally acting on aperiodic necklaces of length $n$ with two colours using the 1--1 correspondences between aperiodic necklaces and irreducible polynomials over the field $\F_2$ of two elements. We notice that this…

Group Theory · Mathematics 2013-04-10 S. Duzhin , D. Pasechnik

In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…

Number Theory · Mathematics 2020-03-03 Zhi-Wei Sun

We present computational algorithms to work with points on the modular curve associated to the normaliser of a non-split Cartan group of prime level $p$. Rather than working with explicit equations, we represent these points using the…

Number Theory · Mathematics 2026-05-29 Marusia Rebolledo , Christian Wuthrich

We construct two complete invariants of oriented classical knots in space. The value of each invariant on any knot is a set, infinite for the first invariant and finite for the second. The finite set is computed algorithmically from any…

Geometric Topology · Mathematics 2023-06-02 Dimitrios Kodokostas

Given a homomorphism from a knot group to a fixed group, we introduce an element of a $K_1$-group, which is a generalization of (twisted) Alexander polynomials. We compare this $K_1$-class with other Alexander polynomials. In terms of…

Geometric Topology · Mathematics 2020-11-24 Takefumi Nosaka

We study the combinatorial properties of final types, which are certain non-decreasing sequences of integers, together with the partitions naturally associated with them. As a consequence, we obtain an identity expressing the $n$-nacci…

Combinatorics · Mathematics 2026-01-27 Dušan Dragutinović

Given a unitary representation of a finite group on a finite-dimensional Hilbert space, we show how to find a state whose translates under the group are distinguishable with the highest probability. We apply this to several quantum oracle…

Quantum Physics · Physics 2015-03-19 Orest Bucicovschi , Daniel Copeland , David A. Meyer , James Pommersheim

Using combinatorial techniques, we answer two questions about simple classical Lie groups. Define $N(G,m)$ to be the number of conjugacy classes of elements of finite order $m$ in a Lie group $G$, and $N(G,m,s)$ to be the number of such…

Combinatorics · Mathematics 2013-11-05 Tamar Friedmann , Richard P. Stanley

The necklace polynomials \[ M_n(x)=\frac1n\sum_{d\mid n}\mu(d)x^{n/d} \] play a central role in discrete mathematics: they count aperiodic necklaces, enumerate monic irreducible polynomials over finite fields, and give the dimensions of…

Combinatorics · Mathematics 2026-05-13 Sunil K. Chebolu , Ján Mináč , Tung T. Nguyen , Nguyen Duy Tân

It is known that there are no more Lyndon words of length n than there are periodic necklaces of same length. This paper considers a similar problem where, additionally, the necklaces must be without some forbidden factors. This problem…

Discrete Mathematics · Computer Science 2016-05-06 Mathilde Noual

The enumeration of Hamiltonian cycles on 2n*2n grids of nodes is a longstanding problem in combinatorics. Previous work has concentrated on counting all cycles. The current work enumerates nonisomorphic cycles -- that is, the number of…

Combinatorics · Mathematics 2014-02-05 Ed Wynn

A bound resembling Pascal's identity is presented for binary necklaces with fixed density using Lyndon words with fixed density. The result is generalized to k-ary necklaces and Lyndon words with fixed content. The bound arises in the study…

Combinatorics · Mathematics 2018-01-30 I. Heckenberger , J. Sawada

The cyclic sieving phenomenon provides a link between a polynomial analogue of Gauss congruence known as $q$-Gauss congruence, and a combinatorial analogue of Gauss congruence based on sequences of cyclic group actions. We strengthen this…

Combinatorics · Mathematics 2024-12-24 Fern Gossow

It is known that each of the successive quotient groups of the grope and solvable filtrations of the knot concordance group has an infinite rank subgroup. The generating knots of these subgroups are constructed using iterated doubling…

Geometric Topology · Mathematics 2020-11-11 Taehee Kim

We consider the problem of geometrically approximating a complex analytic curve in the plane by the image of a polynomial parametrization $t \mapsto (x_1(t),x_2(t))$ of bidegree $(d_1,d_2)$. We show the number of such curves is the number…

Algebraic Geometry · Mathematics 2018-07-11 Taylor Brysiewicz

Let $r$ be a positive integer and let $G_n$ be the reflection group of $n \times n$ monomial matrices whose entries are $r^{th}$ complex roots of unity and let $k \leq n$. We define and study two new graded quotients $R_{n,k}$ and $S_{n,k}$…

Combinatorics · Mathematics 2017-10-25 Kin Tung Jonathan Chan , Brendon Rhoades

The "necklace process", a procedure constructing necklaces of black and white beads by randomly choosing positions to insert new beads (whose color is uniquely determined based on the chosen location), is revisited. This article illustrates…

Probability · Mathematics 2018-07-25 Benjamin Hackl , Helmut Prodinger