I need to find out how many different colorings you can make with 2 colors in a dihedral group $D_n$ with $n$ prime and $m$ black and $p-m$ white beads. So first I compute the cycle index: The cycle index of a dihedral group with $n$ prime (odd) is equal to: $$Z(D_n) = \frac{1}{2}(\frac{1}{n}a_1^n + \frac{(n-1)}{n}a_n + a_1a_2^\frac{n-1}{2})$$ Now I fill in: $$a_1 = (b+w), a_2 = (b^2 + w^2), a_n = (b^n + w^n)$$ After that, I find the number before the $b^mw^{p-m}$ and that is the amount of different colorings with $m$ black and $p-m$ white beads. But is there a general formule to find that number?
2026-04-03 15:40:25.1775230825
coloring with a dihedral group $D_n$ with n prime
298 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in GROUP-THEORY
- What is the intersection of the vertices of a face of a simplicial complex?
- Group with order $pq$ has subgroups of order $p$ and $q$
- How to construct a group whose "size" grows between polynomially and exponentially.
- Conjugacy class formula
- $G$ abelian when $Z(G)$ is a proper subset of $G$?
- A group of order 189 is not simple
- Minimal dimension needed for linearization of group action
- For a $G$ a finite subgroup of $\mathbb{GL}_2(\mathbb{R})$ of rank $3$, show that $f^2 = \textrm{Id}$ for all $f \in G$
- subgroups that contain a normal subgroup is also normal
- Could anyone give an **example** that a problem that can be solved by creating a new group?
Related Questions in GRAPH-THEORY
- characterisation of $2$-connected graphs with no even cycles
- Explanation for the static degree sort algorithm of Deo et al.
- A certain partition of 28
- decomposing a graph in connected components
- Is it true that if a graph is bipartite iff it is class 1 (edge-coloring)?
- Fake induction, can't find flaw, every graph with zero edges is connected
- Triangle-free graph where every pair of nonadjacent vertices has exactly two common neighbors
- Inequality on degrees implies perfect matching
- Proving that no two teams in a tournament win same number of games
- Proving that we can divide a graph to two graphs which induced subgraph is connected on vertices of each one
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Cycle index.
$$Z(D_p) = \frac{1}{2p} \left(a_1^{p} + (p-1) a_p + p a_1 a_2^{(p-1)/2}\right)$$
We are interested in
$$[B^m W^{p-m}] Z(D_p; B+W).$$
This has three components.
First component.
$$[B^m W^{p-m}] \frac{1}{2p} (B+W)^p = \frac{1}{2p} {p\choose m}.$$
Second component.
$$[B^m W^{p-m}] \frac{p-1}{2p} (B^p+W^p).$$
This is using an Iverson bracket:
$$\frac{p-1}{2p} [[m=0 \lor m=p]].$$
Third component.
$$[B^m W^{p-m}] \frac{1}{2} (B+W) (B^2+W^2)^{(p-1)/2}.$$
Now with $p$ prime we cannot have both $m$ and $p-m$ even, or both odd, so one is odd and the other one even. Supposing that $m$ is odd we get
$$[B^{m-1} W^{p-m}] \frac{1}{2} (B^2+W^2)^{(p-1)/2} \\ = [B^{(m-1)/2} W^{(p-m)/2}] \frac{1}{2} (B+W)^{(p-1)/2} = \frac{1}{2} {(p-1)/2 \choose (m-1)/2}.$$
Alternatively, if $p-m$ is odd we get
$$[B^{m} W^{p-m-1}] \frac{1}{2} (B^2+W^2)^{(p-1)/2} \\ = [B^{m/2} W^{(p-m-1)/2}] \frac{1}{2} (B+W)^{(p-1)/2} = \frac{1}{2} {(p-1)/2 \choose m/2}.$$
Closed form.
$$\bbox[5px,border:2px solid #00A000]{ \frac{1}{2p} {p\choose m} + \frac{p-1}{2p} [[m=0 \lor m=p]] + \frac{1}{2} {(p-1)/2 \choose (m-[[m \;\text{odd}]])/2}.}$$
Sanity check.
With a monochrome coloring we should get one as the answer, and we find for $m=0$ ($B^0 W^p = W^p$)
$$\frac{1}{2p} {p\choose 0} + \frac{p-1}{2p} + \frac{1}{2} {(p-1)/2 \choose 0} = \frac{p}{2p} + \frac{1}{2} = 1.$$
Similarly we get for $m=p$ ($B^p W^0 = B^p$)
$$\frac{1}{2p} {p\choose p} + \frac{p-1}{2p} + \frac{1}{2} {(p-1)/2 \choose (p-1)/2} = \frac{p}{2p} + \frac{1}{2} = 1.$$
The sanity check goes through. Another sanity check is $m=1$ or $m=p-1$ which should give one coloring as well. We find
$$\frac{1}{2p} {p\choose 1} + \frac{1}{2} {(p-1)/2\choose 0} = 1$$
and
$$\frac{1}{2p} {p\choose p-1} + \frac{1}{2} {(p-1)/2\choose (p-1)/2} = 1.$$