中文
相关论文

相关论文: Mullineux map: $d$-balanced partitions and $d$-run…

200 篇论文

Let $R_n$ denote the KLR algebra of type $A^{(1)}_{e-1}$. Using the presentation of Specht modules given by Kleschev-Mathas-Ram, Loubert completely determined $\hom_{R_n}(S^\mu,S^\lambda)$ where $\mu$ is an arbitrary partition, $\lambda$ is…

表示论 · 数学 2024-02-19 Berta Hudak

Let $P_r(n)$ be the set of partitions of n with non negative rth differences. Let $\lambda$ be a partition chosen uniformly at random among the set $P_r(n)$. Let $d(\lambda)$ be a positive rth difference chosen uniformly at random in…

组合数学 · 数学 2007-05-23 Rod Canfield , Sylvie Corteel , Pawel Hitczenko

For a graph $G$ on $v(G)$ vertices let $m_k(G)$ denote the number of matchings of size $k$, and consider the partition function $M_{G}(\lambda)=\sum_{k=0}^nm_k(G)\lambda^k$. In this paper we show that if $G$ is a $d$--regular graph and…

组合数学 · 数学 2020-07-01 Márton Borbényi , Péter Csikvári

If $\gcd(r,t)=1$, then a theorem of Alladi offers the M\"obius sum identity $$-\sum_{\substack{ n \geq 2 \\ p_{\rm{min}}(n) \equiv r \pmod{t}}} \mu(n)n^{-1}= \frac{1}{\varphi(t)}. $$ Here $p_{\rm{min}}(n)$ is the smallest prime divisor of…

组合数学 · 数学 2017-05-10 Ken Ono , Robert Schneider , Ian Wagner

Given a matrix M of size n, a digraph D on n vertices is said to be the digraph of M, when M_{ij} is different from 0 if and only if (v_{i},v_{j}) is an arc of D. We give a necessary condition, called strong quadrangularity, for a digraph…

组合数学 · 数学 2007-05-23 Simone Severini

Module is effective representation of ring in Abelian group. Linear map of module over commutative ring is morphism of corresponding representation. This definition is the main subject of the book. To consider this definition from more…

综合数学 · 数学 2016-12-28 Aleks Kleyn

Fix a partition $\mu=(\mu_1,\dotsc,\mu_m)$ of an integer $k$ and positive integer $d$. For each $n>k$, let $\chi^\lambda_\mu$ denote the value of the irreducible character of $S_n$ at a permutation with cycle type…

表示论 · 数学 2020-06-18 Jyotirmoy Ganguly , Amritanshu Prasad , Steven Spallone

We consider the equal sum partition problem, motivated by distance magic graph labeling: Given $n,k \in \N$ such that $k\, | \sum_{i=1}^ni$ and a partition $p_1+\cdots+p_k=n$, when is it possible to find a partition of the set…

组合数学 · 数学 2026-05-08 Shlomo Hoory , Dani Kotlar

We prove that the number of even parts and the number of times that parts are repeated have the same distribution over integer partitions with a fixed perimeter. This refines Straub's analog of Euler's Odd-Distinct partition theorem. We…

组合数学 · 数学 2022-04-07 Zhicong Lin , Huan Xiong , Sherry H. F. Yan

Numerous congruences for partitions with designated summands have been proven since first being introduced and studied by Andrews, Lewis, and Lovejoy. This paper explicitly characterizes the number of partitions with designated summands…

A collection of orthonormal bases for a complex dXd Hilbert space is called mutually unbiased (MUB) if for any two vectors v and w from different bases the square of the inner product equals 1/d: |<v,w>| ^{2}=1/d. The MUB problem is to…

量子物理 · 物理学 2007-05-23 Arthur O. Pittenger , Morton H. Rubin

We classify the pairs of conjugate partitions whose regularisations are images of each other under the Mullineux map. This classification proves a conjecture of Lyle, answering a question of Bessenrodt, Olsson and Xu.

组合数学 · 数学 2012-02-20 Matthew Fayers

The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…

表示论 · 数学 2007-05-23 Tom Halverson , Arun Ram

Rounding has proven to be a fundamental tool in theoretical computer science. By observing that rounding and partitioning of $\mathbb{R}^d$ are equivalent, we introduce the following natural partition problem which we call the {\em secluded…

离散数学 · 计算机科学 2022-11-08 Jason Vander Woude , Peter Dixon , A. Pavan , Jamie Radcliffe , N. V. Vinodchandran

Recently, Andrews defined a partition function $\mathcal{EO}(n)$ which counts the number of partitions of $n$ in which every even part is less than each odd part. He also defined a partition function $\overline{\mathcal{EO}}(n)$ which…

数论 · 数学 2020-02-19 Chiranjit Ray , Rupam Barman

Let $\mathcal U(d)$ be the group of $d\times d$ unitary matrices. We find conditions to ensure that a $\mathcal U(d)$-homogeneous $d$-tuple $\boldsymbol T$ is unitarily equivalent to multiplication by the coordinate functions on some…

泛函分析 · 数学 2023-05-03 Soumitra Ghara , Surjit Kumar , Gadadhar Misra , Paramita Pramanick

Mutually unbiased bases (MUBs) are highly symmetric bases on complex Hilbert spaces, and the corresponding rank-1 projective measurements are ubiquitous in quantum information theory. In this work, we study a recently introduced…

量子物理 · 物理学 2023-10-16 Máté Farkas , Jędrzej Kaniewski , Ashwin Nayak

Let $\lambda=(\lambda_1,\lambda_2,...)$ be a \emph{partition} of $n$, a sequence of positive integers in non-increasing order with sum $n$. Let $\Omega:=\{1,...,n\}$. An ordered partition $P=(A_1,A_2,...)$ of $\Omega$ has \emph{type}…

群论 · 数学 2013-04-30 Jorge André , João Araújo , Peter J. Cameron

A fundamental identity in the representation theory of the partition algeba is $n^k = \sum_{\lambda} f^\lambda m_k^\lambda$ for $n \geq 2k$, where $\lambda$ ranges over integer partitions of $n$, $f^\lambda$ is the number of standard Young…

组合数学 · 数学 2024-12-24 Zhanar Berikkyzy , Pamela E. Harris , Anna Pun , Catherine Yan , Chenchen Zhao

The number of standard Young tableaux possible of shape corresponding to a partition $\lambda$ is called the dimension of the partition and is denoted by $f^{\lambda}$. Partitions with odd dimensions were enumerated by McKay and were…

组合数学 · 数学 2025-11-18 Aditya Khanna