English
Related papers

Related papers: Interpreting the two variable Distance enumerator …

200 papers

In this paper, we use a branch of polyhedral geometry, Ehrhart theory, to expand our combinatorial understanding of congruences for partition functions. Ehrhart theory allows us to give a new decomposition of partitions, which in turn…

Combinatorics · Mathematics 2015-08-04 Felix Breuer , Dennis Eichhorn , Brandt Kronholm

We show the existence of a series of transforms that capture several structures that underlie higher-dimensional partitions. These transforms lead to a sequence of triangles whose entries are given combinatorial interpretations as the…

Combinatorics · Mathematics 2014-01-03 Suresh Govindarajan

Anderson established a connection between core partitions and order ideals of certain posets by mapping a partition to its $\beta$-set. In this paper, we give a characterization of the poset $P_{(s,s+1,s+2)}$ whose order ideals correspond…

Combinatorics · Mathematics 2014-07-10 Jane Y. X. Yang , Michael X. X. Zhong , Robin D. P. Zhou

We study the partition function of the compactified 5D U(1) gauge theory (in the Omega-background) with a single adjoint hypermultiplet, calculated using the refined topological vertex. We show that this partition function is an example a…

High Energy Physics - Theory · Physics 2014-11-18 Amer Iqbal , Can Kozcaz , Khurram Shabbir

In 2012, Pflug and Pichler proved, under regularity assumptions, that the value function in Multistage Stochastic Programming (MSP) is Lipschitz continuous w.r.t. the Nested Distance, which is a distance between scenario trees (or discrete…

Optimization and Control · Mathematics 2021-07-22 Zheng Qu , Benoît Tran

We consider the partition function of the superconformal Chern-Simons theories with the quiver diagram being the affine D-type Dynkin diagram. Rewriting the partition function into that of a Fermi gas system, we show that the perturbative…

High Energy Physics - Theory · Physics 2015-10-28 Sanefumi Moriyama , Tomoki Nosaka

In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…

Combinatorics · Mathematics 2022-11-17 Sylvie Corteel , Sergi Elizalde , Carla Savage

Given a Shi arrangement $\mathcal{A}_\Phi$, it is well-known that the total number of regions is counted by the parking number of type $\Phi$ and the total number of regions in the dominant cone is given by the Catalan number of type…

Combinatorics · Mathematics 2025-11-19 Aram Dermenjian , Eleni Tzanaki

As part of his work to develop an explicit trace formula for Hecke operators on congruence subgroups of $SL_2(\Z)$, Hijikata defines and characterizes the notion of a split order in $M_2(k)$, where $k$ is a local field. In this paper, we…

Number Theory · Mathematics 2008-09-01 Thomas R. Shemanske

We address parameter estimation in second-order stochastic differential equations (SDEs), which are prevalent in physics, biology, and ecology. The second-order SDE is converted to a first-order system by introducing an auxiliary velocity…

Methodology · Statistics 2025-04-17 Predrag Pilipovic , Adeline Samson , Susanne Ditlevsen

The resonance arrangement $\mathcal{A}_n$ is the arrangement of hyperplanes which has all non-zero $0/1$-vectors in $\mathbb{R}^n$ as normal vectors. It is the adjoint of the Braid arrangement and is also called the all-subsets arrangement.…

Combinatorics · Mathematics 2025-05-21 Lukas Kühne

Stanley's theory of $(P,\omega)$-partitions is a standard tool in combinatorics. It can be extended to allow for the presence of a restriction, that is a given maximal value for partitions at each vertex of the poset, as was shown by Assaf…

Combinatorics · Mathematics 2023-03-17 Philippe Nadeau , Vasu Tewari

Let T be a weighted tree with n leaves. Let D_{i,j} be the distance between the leaves i and j. Let D_{i,j,k}= (D_{i,j} + D_{j,k} +D_{i,k})/2. We will call such numbers "triple weights" of the tree. In this paper, we give a…

Algebraic Geometry · Mathematics 2011-04-25 Elena Rubei

The extended coset leader weight enumerator of the generalized Reed-Solomon $[q + 1, q - 3, 5]_q$ code is computed. The computation is considered as a question in finite geometry. For this we need the classification of the points, lines and…

Combinatorics · Mathematics 2021-04-13 Aart Blokhuis , Ruud Pellikaan , Tamás Szőnyi

We introduce the notion of standard multipartitions and establish a one-to-one correspondence between standard multipartitions and irreducible representations with integral weights for the affine Hecke algebra of type A with a parameter q…

Representation Theory · Mathematics 2018-05-09 Jie Du , Jinkui Wan

We write down all orders large $N$ expansions for the dimensions of irreducible representations of $O(N)$ and $Sp(N)$. We interpret all the terms in these expansions as symmetry factors for singular worldsheet configurations, involving…

High Energy Physics - Theory · Physics 2009-10-22 Sanjaye Ramgoolam

We introduce the higher rank $(q,t)$-Catalan polynomials and prove they equal truncations of the Hikita polynomial to a finite number of variables. Using affine compositions and a certain standardization map, we define a dinv statistic on…

Combinatorics · Mathematics 2023-03-29 Nicolle González , José Simental , Monica Vazirani

We improve the estimates in the restriction problem in dimension $n \ge 4$. To do so, we establish a weak version of a $k$-linear restriction estimate for any $k$. The exponents in this weak $k$-linear estimate are sharp for all $k$ and…

Classical Analysis and ODEs · Mathematics 2017-11-06 Larry Guth

A partition into distinct parts is refinable if one of its parts $a$ can be replaced by two different integers which do not belong to the partition and whose sum is $a$, and it is unrefinable otherwise. Clearly, the condition of being…

Combinatorics · Mathematics 2022-05-24 Riccardo Aragona , Lorenzo Campioni , Roberto Civino , Massimo Lauria

Let $s,t$ be natural numbers, and fix an $s$-core partition $\sigma$ and a $t$-core partition $\tau$. Put $d=\gcd(s,t)$ and $m= lcm(s,t)$, and write $N_{\sigma, \tau}(k)$ for the number of $m$-core partitions of length no greater than $k$…

Combinatorics · Mathematics 2022-02-01 K. Seethalakshmi , Steven Spallone