English
Related papers

Related papers: Cyclic Sieving for Strong Dichotomy Enumeration

200 papers

In 1935, Erd\H{o}s proved that the sums $f_k=\sum_n 1/(n\log n)$, over integers $n$ with exactly $k$ prime factors, are bounded by an absolute constant, and in 1993 Zhang proved that $f_k$ is maximized by the prime sum $f_1=\sum_p 1/(p\log…

Number Theory · Mathematics 2024-12-02 Ofir Gorodetsky , Jared Duker Lichtman , Mo Dick Wong

We show that an effective version of Siegel's Theorem on finiteness of integer solutions and an application of elementary Galois theory are key ingredients in a complexity classification of some Holant problems. These Holant problems,…

Computational Complexity · Computer Science 2014-04-16 Jin-Yi Cai , Heng Guo , Tyson Williams

[PLEASE SEE COMMENT] We consider the isomorphism problem for finite abelian groups and finite meta-cyclic groups. We prove that for a dense set of positive integers $n$, isomorphism testing for abelian groups of black-box type of order $n$…

Group Theory · Mathematics 2021-09-03 Heiko Dietrich , James B. Wilson

Given integers $k,l\geq 2$, where either $l$ is odd or $k$ is even, let $n(k,l)$ denote the largest integer $n$ such that each element of $A_n$ is a product of $k$ many $l$-cycles. In 2008, M. Herzog, G. Kaplan and A. Lev proved that if…

Combinatorics · Mathematics 2023-04-25 Harish Kishnani , Rijubrata Kundu , Sumit Chandra Mishra

The Delannoy polynomial $D_n(x)$ is defined by $$ D_n(x)=\sum_{k=0}^{n}{n\choose k}{n+k\choose k}x^k. $$ We prove that, if $x$ is an integer and $p$ is a prime not dividing $x(x+1)$, then \begin{align*} \sum_{k=0}^{p-1}(2k+1)D_k(x)^3…

Number Theory · Mathematics 2014-12-25 Victor J. W. Guo

Fagin defined the class $NP$ by the means of Existential Second-Order logic. Feder and Vardi expressed it (up to polynomial equivalence) by special fragments of Existential Second-Order logic (SNP), while the authors used forbidden expanded…

Computational Complexity · Computer Science 2026-01-09 Gábor Kun , Jaroslav Nešetřil

We study the enumeration of diagonally and antidiagonally symmetric alternating sign matrices (DASASMs) of fixed odd order by introducing a case of the six-vertex model whose configurations are in bijection with such matrices. The model…

Combinatorics · Mathematics 2017-08-01 Roger E. Behrend , Ilse Fischer , Matjaž Konvalinka

We prove a conjecture that classifies exceptional numbers. This conjecture arises in two different ways, from cryptography and from coding theory. An odd integer $t\geq 3$ is said to be exceptional if $f(x)=x^t$ is APN (Almost Perfect…

Information Theory · Computer Science 2024-05-01 Fernando Hernando , Gary McGuire

Let $n$ and $k$ be positive integers, and $f_n(k)$ (resp. $g_n(k)$) be the number of unital subrings (resp. unital irreducible subrings) of $\mathbb{Z}^n$ of index $k$. The numbers $f_n(k)$ are coefficients of certain zeta functions of…

Number Theory · Mathematics 2022-12-01 Hrishabh Mishra , Anwesh Ray

In this short paper, we extend the concept of the strict order polynomial $\Omega_{P}^{\circ}(n)$, which enumerates the number of strict order-preserving maps $\phi:P\rightarrow\boldsymbol{n}$ for a poset $P$, to the extended strict order…

Combinatorics · Mathematics 2020-10-08 Johanna Langner , Henryk A. Witek

We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of…

Combinatorics · Mathematics 2007-05-23 Sophie Huczynska , Vincent Vatter

Let $k$ be a given positive odd integer and $p$ an odd prime. In this paper, we shall give a sufficient condition when a prime $p$ divides the order of the groups $K_{2k}(\mathbb{Z}[\zeta_m+\zeta_m^{-1}])$ and $K_{2k}(\mathbb{Z}[\zeta_m])$,…

Number Theory · Mathematics 2025-08-06 Meng Fai Lim

We prove that for any degree d, there exist (families of) finite sequences a_0, a_1,..., a_d of positive numbers such that, for any real polynomial P of degree d, the number of its real roots is less than or equal to the number of the…

Classical Analysis and ODEs · Mathematics 2016-10-31 J. Forsgård , D. Novikov , B. Shapiro

We investigate the cyclic proof theory of extensions of Peano Arithmetic by (finitely iterated) inductive definitions. Such theories are essential to proof theoretic analyses of certain `impredicative' theories; moreover, our cyclic systems…

Logic · Mathematics 2023-06-16 Anupam Das , Lukas Melgaard

Let $k \,=\, \mathbb{Q}(\sqrt[5]{n},\zeta_5)$, where $n$ is a positive integer, $5^{th}$ power-free, whose $5-$class group is isomorphic to $\mathbb{Z}/5\mathbb{Z}\times\mathbb{Z}/5\mathbb{Z}$. Let $k_0\,=\,\mathbb{Q}(\zeta_5)$ be the…

Number Theory · Mathematics 2022-03-25 Fouad Elmouhib , Mohamed Talbi , Abdelmalek Azizi

Cyclic sieving is a well-known phenomenon where certain interesting polynomials, especially $q$-analogues, have useful interpretations related to actions and representations of the cyclic group. We propose a definition of sieving for an…

Combinatorics · Mathematics 2023-11-16 Sujit Rao , Joe Suk

A famous conjecture of Parkin-Shanks predicts that $p(n)$ is odd with density $1/2$. Despite the remarkable amount of work of the last several decades, however, even showing this density is positive seems out of reach. In a 2018 paper with…

Combinatorics · Mathematics 2021-06-29 Fabrizio Zanello

Recently O. Pechenik studied the cyclic sieving of increasing tableaux of shape $2\times n$, and obtained a polynomial on the major index of these tableaux, which is a $q$-analogue of refined small Schr\"{o}der numbers. We define…

Combinatorics · Mathematics 2019-03-19 Rosena R. X. Du , Xiaojie Fan , Yue Zhao

Using the theory of resolving classes, we show that if $X$ is a CW complex of finite type such that $\map_*(X, S^{2n+1})\sim *$ for all sufficiently large $n$, then $\map_*(X, K) \sim *$ for every simply-connected finite-dimensional CW…

Algebraic Topology · Mathematics 2012-05-04 Jeffrey Strom

Consider the Deligne-Simpson problem: {\em give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\subset GL(n,{\bf C})$ (resp. $c_j\subset gl(n,{\bf C})$) so that there exist irreducible $(p+1)$-tuples of…

Algebraic Geometry · Mathematics 2007-05-23 Vladimir Kostov