Related papers: Cyclic Sieving for Strong Dichotomy Enumeration

We apply the version of P\'{o}lya-Redfield theory obtained by White to count patterns with a given automorphism group to the enumeration of strong dichotomy patterns, that is, we count bicolor patterns of $\mathbb{Z}_{2k}$ with respect to…

In 1960, W. Sierpinski proved that there are infinitely many positive odd numbers $k$, such that for any positive integer $n$, $k\times2^n+1$ is a composite number. Such numbers are called "Sierpinski numbers". In this study, by using…

For relatively prime natural numbers $a$ and $b$, we study the two equations $ax+by = (a-1)(b-1)/2$ and $ax+by+1= (a-1)(b-1)/2$, which arise from the study of cyclotomic polynomials. Previous work showed that exactly one equation has a…

We construct an infinite family of imaginary bicyclic biquadratic number fields $k$ with the 2-ranks of their 2-class groups are $\geq3$, whose strongly ambiguous classes of $k/Q(i)$ capitulate in the absolute genus field $k^{(*)}$, which…

This note describes a conjecture involving cyclotomic polynomials and some initial thoughts towards a solution. Given positive integers $m,n$, the conjecture is that either $\Phi_m(q)\leqslant\Phi_n(q)$ or $\Phi_m(q)\geqslant\Phi_n(q)$…

In this paper, we apply the power-partible reduction to study arithmetic properties of sums involving Delannoy numbers $D_k$ and polynomials $D_k(z)$. Let $v\in\bN$ and $p$ be an odd prime. It is proved that, for any…

For a fixed integer $e \geqslant 3$ and $n$ large enough, we show that the number of congruence classes modulo $2^e$ of characteristic polynomials of $n \times n$ symmetric $\{\pm 1\}$-matrices with constant diagonal is equal to…

In this article we give an order-dividing bijective function between cyclic and non cyclic groups of finite order. In particular, we prove that there exists a bijective function from D_{2n} to Z_{2n} for any natural integer n; and from Z_p…

Let $I_k = [(2k-1)^2, (2k+1)^2)$ for $k \geq 1$. Starting from the odd-composite matrix $(b_{ij})$ with $b_{ij} = (2i-1)(2j-1)$, introduced by the author in [1], we define for each odd integer $n$ the \emph{matrix multiplicity} $r(n)$, the…

Let \mathcal{F}_k denote the family of 2-edge-colored complete graphs on 2k vertices in which one color forms either a clique of order k or two disjoint cliques of order k. Bollob\'as conjectured that for every \epsilon>0 and positive…

We study Constraint Satisfaction Problems (CSPs) in an infinite context. We show that the dichotomy between easy and hard problems -- established already in the finite case -- presents itself as the strength of the corresponding De…

The notion of formal duality in finite Abelian groups appeared recently in relation to spherical designs, tight sphere packings, and energy minimizing configurations in Euclidean spaces. For finite cyclic groups it is conjectured that there…

We examine possibility to design an efficient solving algorithm for problems of the class \np. It is introduced a classification of \np problems by the property that a partial solution of size $k$ can be extended into a partial solution of…

Using cyclotomic specializations of the equivariant $K$-theory with respect to a torus action we derive congruences for discrete invariants of exceptional objects in derived categories of coherent sheaves on a class of varieties that…

In 2003, H\'{e}thelyi and K\"{u}lshammer proposed that if $G$ is a finite group and $p$ is a prime dividing the group order, then $k(G)\geq 2\sqrt{p-1}$, and they proved this conjecture for solvable $G$ and showed that it is sharp for those…

In earlier work, Katz exhibited some very simple one parameter families of exponential sums which gave rigid local systems on the affine line in characteristic p whose geometric (and usually, arithmetic) monodromy groups were SL(2,q), and…

Let $d$ be an odd square-free integer, $m\geq 3$ any integer and $L_{m, d}:=\mathbb{Q}(\zeta_{2^m},\sqrt{d})$. In this paper, we shall determine all the fields $L_{m, d}$ having an odd class number. Furthermore, using the cyclotomic…

We investigate the complexity of explicit construction problems, where the goal is to produce a particular object of size $n$ possessing some pseudorandom property in time polynomial in $n$. We give overwhelming evidence that $\bf{APEPP}$,…

S\'ark\"ozy proved that dense sets of integers contain two elements differing by a $k$th power. The bounds in quantitative versions of this theorem are rather weak compared to what is expected. We prove a version of S\'ark\"ozy's theorem…

Let $\mathcal{P}$ be a chiral polytope with type $\{k_1, k_2\}$ and $G=Aut(\mathcal{P})$. Suppose $|G|=2p^m$, where $k_1, k_2\geq 3$ and $p$ is an odd prime. Let $P$ be a Sylow $p$-subgroup of $G$. We prove that $G \cong P \rtimes…