中文
相关论文

相关论文: p^q-Catalan Numbers and Squarefree Binomial Coeffi…

200 篇论文

We prove that there exist infinitely many (-1,1)-Carmichael numbers, that is, square-free, composite integers n such that p+1 divides n-1 for each prime p dividing n.

数论 · 数学 2022-07-26 Qi-Yang Zheng

An irreducible polynomial over $\Bbb F_q$ is said to be normal over $\Bbb F_q$ if its roots are linearly independent over $\Bbb F_q$. We show that there is a polynomial $h_n(X_1,\dots,X_n)\in\Bbb Z[X_1,\dots,X_n]$, independent of $q$, such…

数论 · 数学 2023-08-03 Xiang-dong Hou

For each $p>0$ we define by recurrence a triangle $T^p(n,k)$ whose rows sum to the Fuss-Catalan numbers $ \frac{1}{p n+1}\binom{pn+1}{n}$, generalizing the known Catalan triangle corresponding to the case $p=2$. (In fact, $T^p(n,k)$ has an…

组合数学 · 数学 2024-02-26 Francesca Aicardi

It is an open problem whether $ \binom{2n}{n} $ is divisible by 4 or 9 for all $n>256$. In connection with this, we prove that for a fixed uneven $m$ the asymptotic density of $k$'s such that $ m \nmid \binom{2^{k+1}}{2^{k}} $ is 0. To do…

We give two proofs of the $q,t$-symmetry of the generalized $q,t$-Catalan number $C_{\vec{k}}(q,t)$ for $\vec{k}=(k_1,k_2,k_3)$. One is by using MacMahon's partition analysis as we proposed; the other is a direct bijection. We also prove…

组合数学 · 数学 2022-06-07 Guoce Xin , Yingrui Zhang

Catalan observed in 1874 that the numbers $S(m,n) = \frac{(2m)! (2n)!}{m! n! (m+n)!}$, now called the super Catalan numbers, are integers but there is still no known combinatorial interpretation for them in general, although interpretations…

组合数学 · 数学 2024-05-06 Kendra Killpatrick

In this note, we study two generalizations of the Catalan numbers, namely the $s$-Catalan numbers and the spin $s$-Catalan numbers. These numbers first appeared in relation to quantum physics problems about spin multiplicities. We give a…

组合数学 · 数学 2021-10-26 William Linz

We show that, for all positive integers $n_1, \ldots, n_m$, $n_{m+1}=n_1$, and any non-negative integers $j$ and $r$ with $j\leqslant m$, the expression $$ \frac{1}{[n_1]}{n_1+n_{m}\brack n_1}^{-1}…

组合数学 · 数学 2017-08-01 Victor J. W. Guo , Su-Dan Wang

We prove a combinatorial identity relating Catalan numbers to tangent numbers arising from the study of peak algebra that was conjectured by Aliniaeifard and Li. This identity leads to the discovery of the intriguing identity $$…

组合数学 · 数学 2025-08-13 Tongyuan Zhao , Zhicong Lin , Yongchun Zang

Let $n,p,k$ be three positive integers. We prove that the rational fractions of $q$: $${n \brack k}_{q} {}_3\phi_{2} [ . {matrix}q^{1-k},q^{-p},q^{p-n} q,q^{1-n} {matrix}| q;q^{k+1}]\quad\textrm{and}\quad q^{(n-p)p}\qbi{n}{k}{q} {}_3\phi_2[…

组合数学 · 数学 2007-05-23 Sharon J. X. Hou , Jiang Zeng

We continue the study of the rational-slope generalized $q,t$-Catalan numbers $c_{m,n}(q,t)$. We describe generalizations of the bijective constructions of J. Haglund and N. Loehr and use them to prove a weak symmetry property…

代数几何 · 数学 2013-12-24 Evgeny Gorsky , Mikhail Mazin

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

交换代数 · 数学 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

Let \( q \) be a prime power and \( n \) an integer. An \( \mathbb{F}_q \)-linearized polynomial \( f \) is said to be scattered if it satisfies the condition that for all \( x, y \in \mathbb{F}_q^n \setminus \{ 0 \} \), whenever \(…

We give a short proof for a formula for the number of divisions of a convex (sn+2)-gon along non-crossing diagonals into (sj+2)-gons, where 1<=j<=n-1. In other words, we consider dissections of an (sn+2)-gon into pieces which can be further…

组合数学 · 数学 2007-05-23 Jozef H. Przytycki , Adam S. Sikora

By using the Newton interpolation formula, we generalize the recent identities on the Catalan triangle obtained by Miana and Romero as well as those of Chen and Chu. We further study divisibility properties of sums of products of binomial…

数论 · 数学 2011-03-25 Victor J. W. Guo , Jiang Zeng

We say a polynomial f having integer coefficients is strongly coefficient convex if the set of coefficients of f consists of consecutive integers only. We establish various results suggesting that the divisors of x^n-1 with integer…

数论 · 数学 2020-08-28 Andreas Decker , Pieter Moree

The q-Catalan numbers studied by Carlitz and Riordan are polynomials in q with nonnegative coefficients. They evaluate, at q=1, to the Catalan numbers: 1, 1, 2, 5, 14,..., a log-convex sequence. We use a combinatorial interpretation of…

组合数学 · 数学 2007-05-23 L. M. Butler , W. P. Flanigan

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

数论 · 数学 2014-07-21 David Krumm

Let $\mathbb{F}_{q}$ be a finite field with $q$ elements, where $q$ is a power of prime $p$. A polynomial over $\mathbb{F}_{q}$ is square-free if all its monomials are square-free. In this note, we determine an upper bound on the number of…

交换代数 · 数学 2020-10-27 Nupur Patanker , Sanjay Kumar Singh

The existence of a partial quadrangle ${\mathsf{PQ}}(s, t, \mu)$ is equivalent to the existence of a diamond-free strongly regular graph ${\mathsf{SRG}}(1+s(t+1)+s^2t(t+1)/\mu, s(t+1), s-1, \mu)$. Recently, it is shown that there exists a…

组合数学 · 数学 2013-03-05 A. Mohammadian , B. Tayfeh-Rezaie