中文
相关论文

相关论文: Four-generated direct powers of partition lattices…

200 篇论文

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

For a given complete lattice L, we investigate whether L can be decomposed as a direct product of directly indecomposable lattices. We prove that this is the case if every element of L is a join of join-irreducible elements and dually, thus…

综合数学 · 数学 2007-05-23 Friedrich Wehrung

This article investigates atomic decompositions in geometric lattices isomorphic to the partition lattice $\Pi(X)$ of a finite set $X$, a fundamental structure in lattice theory and combinatorics. We explore the role of atomicity in these…

组合数学 · 数学 2025-06-19 Alex Aguila , Elvis Cabrera , Jyrko Correa-Morris

In 2010, G.-N. Han obtained the generating function for the number of size $t$ hooks among integer partitions. Here we obtain these generating functions for self-conjugate partitions, which are particularly elegant for even $t$. If…

组合数学 · 数学 2024-02-09 Tewodros Amdeberhan , George E. Andrews , Ken Ono , Ajit Singh

Let $a,b\in \mathbb{N}$ be fixed and coprime such that $a>b$, and let $N$ be any number of the form $a^n\pm b^n$, $n\in\mathbb{N}$. We will generalize a result of Bostan, Gaudry and Schost and prove that we may compute the prime…

数论 · 数学 2017-09-20 Markus Hittmeir

The partition function $ p_{[1^c11^d]}(n)$ can be defined using the generating function, \[\sum_{n=0}^{\infty}p_{[1^c{11}^d]}(n)q^n=\prod_{n=1}^{\infty}\dfrac{1}{(1-q^n)^c(1-q^{11 n})^d}.\] In this paper, we prove infinite families of…

数论 · 数学 2019-06-04 Shashika Petta Mestrige

A large-scale experiment was conducted to find formulas relating to the base $e^\pi$. The numbers in this base are $$x = \sum_{n=0}^\infty {a(n)\over e^{\pi n}}$$ where $a(n)$ is taken from the OEIS catalog. These experiments were inspired…

数论 · 数学 2025-09-22 Simon Plouffe

We show that, for a certain class of partitions and an even number of variables of which half are reciprocals of the other half, Schur polynomials can be factorized into products of odd and even orthogonal characters. We also obtain related…

组合数学 · 数学 2019-02-07 Arvind Ayyer , Roger E. Behrend

Let $G$ be a $k$-partite graph with $n$ vertices in parts such that each vertex is adjacent to at least $\delta^*(G)$ vertices in each of the other parts. Magyar and Martin \cite{MaMa} proved that for $k=3$, if $\delta^*(G)\ge 2/3n $ and…

组合数学 · 数学 2015-01-29 Jie Han , Yi Zhao

We study the combinatorial properties of final types, which are certain non-decreasing sequences of integers, together with the partitions naturally associated with them. As a consequence, we obtain an identity expressing the $n$-nacci…

组合数学 · 数学 2026-01-27 Dušan Dragutinović

Fix a prime N, and consider the action of the Hecke operator T_N on the space M_k(SL(2,Z)) of modular forms of full level and varying weight k. The coefficients of the matrix of T_N with respect to the basis {E_4^i E_6^j | 4i + 6j = k} for…

数论 · 数学 2012-04-09 Hala Hajj Shehadeh , Samar Jaafar , Kamal Khuri-Makdisi

The block count of an equivalence $\mu\in$ Equ$(A)$ is the number blnum$(\mu)$ of blocks of (the partition corresponding to) $\mu$. We say that $X=\{\mu_1,\mu_2,\mu_3,\mu_4\}$ is a four-element generating set of Equ$(A)$ with consecutive…

环与代数 · 数学 2024-10-22 Gábor Czédli

The fourth-order lattice Gel'fand-Dikii equations in quadrilateral form are investigated. Utilizing the direct linearization approach, we present some equations of the extended lattice Gel'fand-Dikii type. These equations are related to a…

可精确求解与可积系统 · 物理学 2023-02-22 Guesh Yfter Tela , Song-Lin Zhao , Da-Jun Zhang

In 2003, Alladi, Andrews and Berkovich proved an identity for partitions where parts occur in eleven colors: four primary colors, six secondary colors, and one quaternary color. Their work answered a longstanding question of how to go…

组合数学 · 数学 2021-05-21 Isaac Konan

We prove combinatorially some identities related to Euler's partition identity (the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts). They were conjectured by Beck and proved by Andrews…

组合数学 · 数学 2018-07-02 Cristina Ballantine , Richard Bielak

Motivated by practical concerns in cryptography, we study pseudorandomness properties of permutations on $\{0,1\}^n$ computed by random circuits made from reversible $3$-bit gates (permutations on $\{0,1\}^3$). Our main result is that a…

密码学与安全 · 计算机科学 2025-02-12 William Gay , William He , Nicholas Kocurek , Ryan O'Donnell

It is widely believed that the parity of the partition function $p(n)$ is ``random.'' Contrary to this expectation, in this note we prove the existence of infinitely many congruence relations modulo 4 among its values. For each square-free…

数论 · 数学 2022-12-15 Ken Ono

We give a presentation by generators and relations of the group $U_4(\mathbb{Z}[1/\sqrt{2},i])$ of unitary $4\times 4$ matrices with entries in the ring $\mathbb{Z}[1/\sqrt{2},i]$. This is motivated by the problem of exact synthesis for the…

量子物理 · 物理学 2014-08-27 Seth Eveson Murray Greylyn

We show that the discretized configuration space of $k$ points in the $n$-simplex is homotopy equivalent to a wedge of spheres of dimension $n-k+1$. This space is homeomorphic to the order complex of the poset of ordered partial partitions…

几何拓扑 · 数学 2011-09-30 Aaron Abrams , David Gay , Valerie Hower

We introduce a concept of a Goldbach factorization graph (GFG) $F_n$, which can be constructed for each even integer $n$ greater than 2. We prove that, if $n$ does not satisfy the binary Goldbach conjecture (BGC), then $F_n$ contains a…

数论 · 数学 2019-09-24 Andrzej Bożek