中文
相关论文

相关论文: Hook lengths and 3-cores

200 篇论文

Brundan, Kleshchev and Wang equip the Specht modules $S_{\lambda}$ over the cyclotomic Khovanov--Lauda--Rouquier algebra $\mathscr{H}_n^{\Lambda}$ with a homogeneous $\mathbb{Z}$-graded basis. In this paper we begin the study of graded…

表示论 · 数学 2019-08-02 Louise Sutton

In a recent paper (arXiv:2301.09744), Erickson and Hunziker consider partitions in which the arm-leg difference is an arbitrary constant $m$. In previous works, these partitions are called $(-m)$-asymmetric partitions. Regarding these…

组合数学 · 数学 2023-05-16 Nishu Kumari

Green and Sisask showed that the maximal number of $3$-term arithmetic progressions in $n$-element sets of integers is $\lceil n^2/2\rceil$; it is easy to see that the same holds if the set of integers is replaced by the real line or by any…

组合数学 · 数学 2023-02-08 Itai Benjamini , Shoni Gilboa

Let $M^{reg}$ be the topological moduli space of long knots up to regular isotopy, and for any natural number $n > 1$ let $M^{reg}_n$ be the moduli space of all n-cables of framed long knots which are twisted by a string link to a knot in…

几何拓扑 · 数学 2021-04-07 Thomas Fiedler

Let A be a nonempty finite set of relatively prime positive integers, and let p_A(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for p_A(n).

数论 · 数学 2016-12-30 Melvyn B. Nathanson

A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…

组合数学 · 数学 2020-03-31 Jakub Przybyło

We study the irreducibility of Wronskian Hermite polynomials labelled by partitions. It is known that these polynomials factor as a power of x times a remainder polynomial. We show that the remainder polynomial is irreducible for the…

经典分析与常微分方程 · 数学 2020-07-02 Codruţ Grosu , Corina Grosu

We determine an infinite family of linear identities for the number $A_4(n)$ of partition pairs of $n$ with $4$-cores by employing elementary $q$-series techniques and certain $3$-dissection formulas. We then discover an infinite family of…

数论 · 数学 2026-02-11 Russelle Guadalupe

In 2018, Sz\"{o}ll\H{o}si and \"{O}sterg\r{a}rd used a computer to enumerate sets of equiangular lines with common angle $\arccos(1/3)$ in dimension $7$. They observed that the numbers $\omega(n)$ of sets of $n$ equiangular lines with…

组合数学 · 数学 2025-06-12 Kiyoto Yoshino

A partition of degree $n$ is a decomposition $n=i_1+i_2+\dots+i_q$, where ${i_1,i_2,\dots,i_q}$ are positive integers called the parts of the partition. Let $\lambda>0$ be an integer. The partition is said to be a $\lambda$--partition if…

组合数学 · 数学 2017-03-22 F. V. Weinstein

Suppose that $a_1(n),a_2(n),...,a_s(n),m(n)$ are integer-valued polynomials in $n$ with positive leading coefficients. This paper presents Popoviciu type formulas for the generalized restricted partition function…

数论 · 数学 2007-09-25 Nan Li , Sheng Chen

The Collatz Conjecture can be stated as: using the reduced Collatz function $C(n) = (3n+1)/2^x$ where $2^x$ is the largest power of 2 that divides $3n+1$, any odd integer $n$ will eventually reach 1 in $j$ iterations such that $C^j(n) = 1$.…

综合数学 · 数学 2019-10-18 Erhan Tezcan

Let $a_k(n)$ denote the number of partitions of $n$ wherein even parts come in only one color, while the odd parts may be ``colored" with one of $k$ colors, for fixed $k$. In this note, we find some congruences for $a_k(n)$ in the spirit of…

数论 · 数学 2026-01-21 Anjelin Mariya Johnson , James A. Sellers , S. N. Fathima

The algebra of truncated polynomials A_m=Z[x]/(x^m) plays an important role in the theory of Khovanov and Khovanov-Rozansky homology of links. We have demonstrated that Hochschild homology is closely related to Khovanov homology via…

几何拓扑 · 数学 2007-05-23 Milena D. Pabiniak , Jozef H. Przytycki , Radmila Sazdanovic

Let $1 \le m \le n$. We prove various results about the chessboard complex $M_{m,n}$, which is the simplicial complex of matchings in the complete bipartite graph $K_{m,n}$. First, we demonstrate that there is nonvanishing 3-torsion in…

组合数学 · 数学 2012-03-27 Jakob Jonsson

For primes $\ell$ and nonnegative integers $a$, we study the partition functions $$p_\ell(a;n):= \#\{\lambda \vdash n : \text{ord}_\ell(H(\lambda))=a\},$$ where $H(\lambda)$ denotes the product of hook lengths of a partition $\lambda$.…

数论 · 数学 2023-06-05 Annemily G. Hoganson , Thomas Jaklitsch

We derive the asymptotic formula for $p_n(N,M)$, the number of partitions of integer $n$ with part size at most $N$ and length at most $M$. We consider both $N$ and $M$ are comparable to $\sqrt{n}$. This is an extension of the classical…

组合数学 · 数学 2019-03-14 Tiefeng Jiang , Ke Wang

We show that while the number of coprime compositions of a positive integer $n$ into $k$ parts can be expressed as a $\mathbb{Q}$-linear combinations of the Jordan totient functions, this is never possible for the coprime partitions of $n$…

数论 · 数学 2021-01-19 Daniela Bubboloni , Florian Luca

We introduce the notion of arithmetic progression blocks or AP-blocks of $\mathbb{Z}_n$, which can be represented as sequences of the form $(x, x+m, x+2m, ..., x+(i-1)m) \pmod n$. Then we consider the problem of partitioning $\mathbb{Z}_n$…

组合数学 · 数学 2008-05-13 William Y. C. Chen , David G. L. Wang , Iris F. Zhang

We prove a conjecture by Diaz-Lopez et al. that bounds the roots of descent polynomials. To do so, we prove an algebraic inequality, which we refer to as the "Slice and Push Inequality." This inequality compares expressions that come from…

组合数学 · 数学 2021-09-21 Pakawut Jiradilok , Thomas McConville
‹ 上一页 1 8 9 10 下一页 ›