English
Related papers

Related papers: The Rank-Generating Functions of Upho Posets

200 papers

We consider the isotropic perimeter generating functions of three-choice, imperfect, and 1-punctured staircase polygons, whose 8th order linear Fuchsian ODEs are previously known. We derive simple relationships between the three generating…

Mathematical Physics · Physics 2016-07-11 M. Assis , M. van Hoeij , J-M. Maillard

For a standard graded algebra $R$, we consider embeddings of the the poset of Hilbert functions of quotients of $R$ into the poset of ideals of $R$, as a way of classification of Hilbert functions. There are examples of rings for which such…

Commutative Algebra · Mathematics 2012-08-09 Giulio Caviglia , Manoj Kummini

In this paper we prove that there exists a Zariski dense open subset U defined over the rationals Q in the space of all one-variable rational functions with arbitrary k poles of prescribed orders, such that for every geometric point f in…

Number Theory · Mathematics 2007-05-23 Hanfeng Li , Hui June Zhu

Let A be a set of integers and let h \geq 2. For every integer n, let r_{A, h}(n) denote the number of representations of n in the form n=a_1+...+a_h, where a_1,...,a_h belong to the set A, and a_1\leq ... \leq a_h. The function r_{A,h}…

Number Theory · Mathematics 2021-01-06 Javier Cilleruelo , Melvyn B. Nathanson

As a consequence of Kirchberg's work, Connes' Embedding Conjecture is equivalent to the property that every homomorphism of the group $F_\infty\times F_\infty$ into the unitary group $U(\ell^2)$ with the strong topology is pointwise…

Representation Theory · Mathematics 2021-08-31 Vladimir G. Pestov , Vladimir V. Uspenskij

The set of all permutations, ordered by pattern containment, forms a poset. This paper presents the first explicit major results on the topology of intervals in this poset. We show that almost all (open) intervals in this poset have a…

Combinatorics · Mathematics 2015-03-24 Peter R. W. McNamara , Einar Steingrimsson

For each composition $\vec{c}$ we show that the order complex of the poset of pointed set partitions $\Pi^{\bullet}_{\vec{c}}$ is a wedge of spheres of the same dimension with the multiplicity given by the number of permutations with…

Combinatorics · Mathematics 2013-12-10 Richard Ehrenborg , JiYoon Jung

Let H[N] denote the tensor product of n finite dimensional Hilbert spaces H(r). A state |phi> of H[N] is separable if |phi> is the tensor product of states in the respective product spaces. An orthogonal unextendible product basis is a…

Quantum Physics · Physics 2007-05-23 Arthur O. Pittenger

For a complex quasi-projective manifold with a finite group action, we define higher order generalized Euler characteristics with values in the Grothendieck ring of complex quasi-projective varieties extended by the rational powers of the…

Algebraic Geometry · Mathematics 2013-03-25 S. M. Gusein-Zade , I. Luengo , A. Melle-Hernández

We show that for every $N\ge 3$ the free unitary group $U^+_N$ is topologically generated by its classical counterpart $U_N$ and the lower-rank $U^+_{N-1}$. This allows for a uniform inductive proof that a number of finiteness properties,…

Quantum Algebra · Mathematics 2019-04-09 Alexandru Chirvasitu

We show that basic homotopical notions such as homotopy sets and groups, connected and truncated maps, cellular constructions and skeleta, etc., extend to the setting of $(\infty,\infty)$-categories, as well as to presentable categories…

Algebraic Topology · Mathematics 2026-04-16 David Gepner , Hadrian Heine

Stanley and Grinberg introduced a symmetric function associated with digraphs and named it the Redei-Berge symmetric function. This function arises from a suitable combinatorial Hopf algebra on digraphs, which made it possible to assign the…

Combinatorics · Mathematics 2025-04-30 Stefan Mitrovic

We design a class of Chudnovsky-type algorithms multiplying k elements of a finite extension of order n a finite field K. We prove that these algorithms give a tensor decomposition of the k-multiplication for which the rank is linear in n…

Number Theory · Mathematics 2025-05-29 Stéphane Ballet , Robert Rolland

We introduce the poset of mesh patterns, which generalises the permutation pattern poset. We fully classify the mesh patterns for which the interval [1^\emptyset,m] is non-pure, where 1^\emptyset is the unshaded singleton mesh pattern. We…

Combinatorics · Mathematics 2018-02-26 Jason P. Smith , Henning Ulfarsson

This paper establishes a link between the theory of cluster algebras and the theory of representations of partially ordered sets. We introduce a class of posets by requiring avoidance of certain types of peak-subposets and show that these…

Representation Theory · Mathematics 2019-12-17 Ralf Schiffler , Robinson-Julian Serna

We present an algorithm to compute the rank of a configuration of the sandpile model for the complete bipartite graph K_{m,n} of complexity O(m+n). Furthermore, we provide a formula for the generating function of parking sorted…

Combinatorics · Mathematics 2016-08-05 Michele D'Adderio , Yvan Le Borgne

We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank $\omega_1^{CK}$, the computable infinitary theory is $\aleph_0$-categorical. Millar and Sacks asked whether this…

Logic · Mathematics 2016-06-06 Matthew Harrison-Trainor , Gregory Igusa , Julia F. Knight

The goal of this paper is to give an explicit construction of the Fock spaces of the parafermion and the paraboson algebra, for an infinite set of generators. This is equivalent to constructing certain unitary irreducible lowest weight…

High Energy Physics - Theory · Physics 2009-08-24 N. I. Stoilova , J. Van der Jeugt

We enumerate traceless square matrices over finite quotients of compact discrete valuation rings by their image sizes. We express the associated rational generating functions in terms of statistics on symmetric and hyperoctahedral groups,…

Group Theory · Mathematics 2017-11-09 Angela Carnevale , Shai Shechter , Christopher Voll

Set $[n]=\{1, 2, \ldots , n\}$. The hypergrid $[t]^n$ is the collection of functions $f: \ [n]\rightarrow [t]$. We equip it with the natural partial order by letting $f\leq g$ whenever $f(x)\leq g(x)$ holds for all $x\in [n]$. Given a poset…

Combinatorics · Mathematics 2026-04-15 R. Altar Ciceksiz , Victor Falgas-Ravry , Sabrina Lato , Maryam Sharifzadeh