Characterizing the supernorm partition statistic

نویسندگان

چکیده

Abstract The paper gives characterizations of the supernorm statistic $$\widehat{N} :\mathcal {P}\rightarrow \mathbb {N}^{+}$$ N ^ : P → + for partitions, where $$\mathcal {P}$$ is set integer partitions and $$\mathbb positive integers. map a bijection onto that defines total order on ordering, obtained by pulling back additive . ordering refines two partial orders partitions: multiset inclusion order, whose image under $$\widehat{N}$$ divisibility lattice , Young’s order. shows it characterized these properties, additionally with requirement an order-isomorphism from to It also mapping exactly one part bijectively prime numbers. presents construction showing latter additional conditions are necessary characterization hold.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterizing partition functions of the vertex model

Let G denote the collection of all undirected graphs, two of them being the same if they are isomorphic. In this paper, all graphs are finite and may have loops and multiple edges. Let k ∈ N and let F be a commutative ring. Following de la Harpe and Jones [4], call any function y : N → F a (k-color) vertex model (over F).6 The partition function of y is the function fy : G → F defined for any g...

متن کامل

Characterizing the D2 statistic: word matches in biological sequences.

Word matches are often used in sequence comparison methods, either as a measure of sequence similarity or in the first search steps of algorithms such as BLAST or BLAT. The D2 statistic is the number of matches of words of k letters between two sequences. Recent advances have been made in the characterization of this statistic and in the approximation of its distribution. Here, these results ar...

متن کامل

Characterizing partition functions of edge-coloring models

Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: http://uba.uva.nl/en/contact, or a letter to: Library of ...

متن کامل

New Partition Statistic Bg-rank and Its Applications

Let π denote partition into parts λ1 ≥ λ2 ≥ λ3 . . .. In [2] we defined BG-rank(π) as

متن کامل

Characterizing partition functions of the spin model by rank growth

In this paper, all graphs are undirected and finite and may have loops and multiple edges. An edge connecting vertices u and v is denoted by uv. Let G denote the collection of all undirected graphs, two of them being the same if they are isomorphic. A graph invariant is any function f : G → C. We consider a special class of graph invariants, namely partition functions of spin models, defined as...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ramanujan Journal

سال: 2023

ISSN: ['1572-9303', '1382-4090']

DOI: https://doi.org/10.1007/s11139-023-00754-w