中文
相关论文

相关论文: Self-complementary plane partitions by Proctor's m…

200 篇论文

Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several…

We prove equidistribution of two pairs of statistics on boxed plane partitions: (volume, trace) and (corner-hook volume, number of corners). The proof relies on different 3d visualizations of the corresponding non-intersecting path systems.…

组合数学 · 数学 2026-05-15 Alimzhan Amanov , Damir Yeliussizov

The paper presents a discussion on the asymptotic formula for the number of plane partitions of a large positive integer.

组合数学 · 数学 2007-05-23 Ljuben Mutafchiev , Emil Kamenov

We give another proof for the (-1)-enumeration of self-complementary plane partitions with at least one odd side-length by specializing a certain Schur function identity. The proof is analogous to Stanley's proof for the ordinary…

组合数学 · 数学 2007-05-23 Theresia Eisenkölbl

In the paper, the authors present several new relations and applications for the combinatorial sequence that counts the possible partitions of a finite set with the restriction that the size of each block is contained in a given set. One of…

组合数学 · 数学 2018-04-12 Beáta Bényi , José L. Ramírez

We give examples of smooth plane quartics over $\mathbb{Q}$ with complex multiplication over $\overline{\mathbb{Q}}$ by a maximal order with primitive CM type. We describe the required algorithms as we go, these involve the reduction of…

We introduce the problem of partitioning 2D regions (usually convex regions) into mutually congruent pieces ('tiles').

组合数学 · 数学 2010-08-03 R. Nandakumar

We say two posets are "doppelg\"angers" if they have the same number of $P$-partitions of each height $k$. We give a uniform framework for bijective proofs that posets are doppelg\"angers by synthesizing $K$-theoretic Schubert calculus…

组合数学 · 数学 2022-03-25 Zachary Hamaker , Rebecca Patrias , Oliver Pechenik , Nathan Williams

It is pointed out that, for the fractional Fokker-Planck equation for subdiffusion proposed by Metzler, Barkai, and Klafter [Phys. Rev. Lett. 82 (1999) 3563], there are four types of infinitely many exact solutions associated with the newly…

统计力学 · 物理学 2020-04-29 C. -L. Ho

We study the Schur polynomial expansion of a family of symmetric polynomials related to the refined enumeration of alternating sign matrices with respect to their inversion number, complementary inversion number and the position of the…

组合数学 · 数学 2020-05-27 Florian Aigner , Ilse Fischer , Matjaž Konvalinka , Philippe Nadeau , Vasu Tewari

An overview is given of the methods for treating complicated problems without small parameters, when the standard perturbation theory based on the existence of small parameters becomes useless. Such complicated problems are typical of…

高能物理 - 唯象学 · 物理学 2011-07-19 V. I. Yukalov , E. P. Yukalova

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

We construct a class of super-reflexive complementably minimal spaces, and study uniformly convex distortions of the norm on Hilbert space by using methods of complex interpolation.

泛函分析 · 数学 2009-09-25 Peter G. Casazza , Nigel J. Kalton , Denka Kutzarova , M. Mastylo

In this note we show that pattern matching in permutations is polynomial time reducible to pattern matching in set partitions. In particular, pattern matching in set partitions is NP-Complete.

组合数学 · 数学 2020-09-02 Thomas Grubb

We use categorical method and birational geometry to study moduli spaces of quiver representations. From certain "representable" functor, we construct a birational transformation from the moduli space of representations of one quiver to…

代数几何 · 数学 2013-04-15 Jiarui Fei

A method of embedding partially ordered sets into linear spaces is presented. The problem of finding all orthocomplementations in a finite lattice is reduced to a linear programming problem.

组合数学 · 数学 2007-05-23 George Parfionov , Roman Zapatrin

Any subset of the plane can be approximated by a set of square pixels. This transition from a shape to its pixelation is rather brutal since it destroys geometric and topological information about the shape. Using a technique inspired by…

微分几何 · 数学 2011-05-17 Brandon Rowekamp

The paper is devoted to an approach to the notion of the complex dilatation based on the following observations. (1) A natural measure of the distortion of the conformal structure by a real linear automorphism of the complex plane is the…

复变函数 · 数学 2023-10-31 Nikolai V. Ivanov

Many results in mass partitions are proved by lifting $\mathbb{R}^d$ to a higher-dimensional space and dividing the higher-dimensional space into pieces. We extend such methods to use lifting arguments to polyhedral surfaces. Among other…

组合数学 · 数学 2021-09-09 Pablo Soberón , Yuki Takahashi

High-energy, multi-component plasmas in which pair creation and annihilation, lepton-lepton scattering, lepton-proton scattering, and Comptonization all contribute to establishing the particle and photon distributions, are present in a…

天体物理学 · 物理学 2014-10-13 Sergei Nayakshin , Fulvio Melia