相关论文: On the diagonal hooks of a symmetric partition

Stanley defined a partition function t(n) as the number of partitions $\lambda$ of n such that the number of odd parts of $\lambda$ is congruent to the number of odd parts of the conjugate partition $\lambda'$ modulo 4. We show that t(n)…

In the paper [J. Combin. Theory Ser. A 43 (1986), 103--113], Stanley gives formulas for the number of plane partitions in each of ten symmetry classes. This paper together with results by Andrews [J. Combin. Theory Ser. A 66 (1994), 28-39]…

We study the computational complexity of a diagonalization technique for multivariate homogeneous polynomials, that is, expressing them as sums of powers of independent linear forms. It is based on Harrison's center theory and consists of a…

A central building block of many quantum algorithms is the diagonalization of Pauli operators. Although it is always possible to construct a quantum circuit that simultaneously diagonalizes a given set of commuting Pauli operators, only…

In this talk we show that any spherically symmetric spacetime admits locally a maximal spacelike slicing. The above condition is reduced to solve a decoupled system of first order quasi-linear partial differential equations. The solution…

Let X be a topological space. The closure of \Delta = {(x, x) : x \in X} in X \times X is a symmetric relation on X. We characterise those equivalence relations on an infinite set that arise as the closure of the diagonal with respect to a…

Partition theory abounds with bijections between different types of partitions. One of the most famous partition bijections maps each self-conjugate partition of a positive integer $n$ to a partition of $n$ into distinct odd parts, and vice…

We propose a hierarchical splitting approach to differential equations that provides a design principle for constructing splitting methods for $N$-split systems by iteratively applying splitting methods for two-split systems. We analyze the…

We show how basic orders for defect two blocks of symmetric groups over the ring of $p$-adic integers can be constructed by purely combinatorial means.

Block encoding is a successful technique used in several powerful quantum algorithms. In this work we provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure. The proposed methodology is…

Let P be a polygon whose vertices have been colored (labeled) cyclically with the numbers 1,2,...,c. Motivated by conjectures of Propp, we are led to consider partitions of P into k-gons which are proper in the sense that each k-gon…

We prove an identity about partitions involving new combinatorial coefficients. The proof given is using a generating function. As an application we obtain the explicit expression of two shifted symmetric functions, related with Jack…

Inspired by Gansner's elegant $k$-trace generating function for rectangular plane partitions, we introduce two novel operators, $\varphi_{z}$ and $\psi_{z}$, along with their combinatorial interpretations. Through these operators, we derive…

The Borel-Weil-Bott theorem can be used to decompose the cohomology of twisted sheaves of holomorphic forms on the complex Grassmannian into irreducible representations of the general linear group. By analyzing this decomposition, we…

We calculate the total number of humps in Dyck and in Motzkin paths, and we give Standard-Young-Tableaux-interpretations of the numbers involved. One then observes the intriguing phenomena that the humps-calculations change the partitions…

We derive an explicit sum formula for symmetric Macdonald polynomials. Our expression contains multiple sums over the symmetric group and uses the action of Hecke generators on the ring of polynomials. In the special cases $t=1$ and $q=0$,…

Given a partition $\lambda$ of a number $k$, it is known that by adding a long line of length $n-k$, the dimension of the associated representation of $S_{n}$ is an integer-valued polynomial of degree $k$ in $n$. We show that its expansion…

We study the problem of partitioning a given simple polygon $P$ into a minimum number of connected polygonal pieces, each of bounded size. We describe a general technique for constructing such partitions that works for several notions of…

We establish sharp $L^p$ integral mean estimates for $(\alpha,\beta)$-harmonic functions on the unit disk. Explicit bounds for the functions and their partial derivatives are obtained in terms of boundary data, by means of the associated…

Derivative polynomials in two variables are defined by repeated differentiation of the tangent and secant functions. We establish the connections between the coefficients of these derivative polynomials and the numbers of interior and left…