English
Related papers

Related papers: Whitney Twins, Whitney Duals, and Operadic Partiti…

200 papers

We tersely review a recently introduced technique to identify systems of two nonlinearly-coupled Ordinary Di{\S}erential Equations (ODEs) solvable by algebraic operations; and we report some specifc examples of this kind, namely systems of…

Mathematical Physics · Physics 2020-01-08 Francesco Calogero , Farrin Payandeh

There are three universal $2$-parameter vertex algebras $\mathcal{W}_{\infty}$, $\mathcal{W}^{\text{ev}}_{\infty}$, and $\mathcal{W}^{\mathfrak{sp}}_{\infty}$ which are freely generated of types $\mathcal{W}(2,3,4,\dots)$,…

Quantum Algebra · Mathematics 2025-12-23 Thomas Creutzig , Vladimir Kovalchuk , Andrew R. Linshaw

This is a survey on the categorification of the poset of generalized non-crossing partitions, using the representation theory of a hereditary artin algebra H, looking at the set P of exceptional subcategories in mod H. This categorification…

Representation Theory · Mathematics 2015-08-26 Claus Michael Ringel

In this paper we describe operads encoding two different kinds of compatibility of algebraic structures. We show that there exist decompositions of these in terms of black and white products and we prove that they are Koszul for a large…

Algebraic Topology · Mathematics 2008-09-24 Henrik Strohmayer

Among other things, we prove that, for a doubling weight $w$, $0< p\leq\infty$, $r\in{\mathbb N}_0$, and $0<\alpha <r+1 - 1/\lambda_p$, we have \[ E_n(f)_{p, w_n} = O(n^{-\alpha}) \iff \omega_\varphi^{r+1}(f, n^{-1})_{p, w_n} =…

Classical Analysis and ODEs · Mathematics 2015-07-20 Kirill A. Kopotun

We propose a matrix approach for generating naturally labeled posets by representing each poset $P$ on the set $[n]$ as a Boolean poset matrix $A$. This algebraic representation enables a systematic handling of partial orderings through…

Combinatorics · Mathematics 2026-05-19 Gi-Sang Cheon , Samuele Giraudo , Gukwon Kwon , Hojoon Lee

We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…

Combinatorics · Mathematics 2024-09-17 Amritanshu Prasad , Samrith Ram

We study generating functions of strict and non-strict order polynomials of series-parallel posets, called order series. These order series are closely related to Ehrhart series and h*-polynomials of the associated order polytopes. We…

Combinatorics · Mathematics 2026-01-27 Jose Antonio Arciniega-Nevarez , Marko Berghoff , Eric Dolores-Cuenca

A binary relation defined on a poset is a weakening relation if the partial order acts as a both-sided compositional identity. This is motivated by the weakening rule in sequent calculi and closely related to models of relevance logic. For…

Logic in Computer Science · Computer Science 2023-01-06 Peter Jipsen , Jaš Šemrl

The purpose of this note is to introduce a new approach to the study of one of the most basic and seemingly intractable problems in partition theory, namely the conjecture that the partition function $p(n)$ is equidistributed modulo 2. Our…

Combinatorics · Mathematics 2018-08-28 Samuel D. Judge , William J. Keith , Fabrizio Zanello

Feigin-Frenkel duality is the isomorphism between the principal $\mathcal{W}$-algebras of a simple Lie algebra $\mathfrak{g}$ and its Langlands dual Lie algebra ${}^L\mathfrak{g}$. A generalization of this duality to a larger family of…

Quantum Algebra · Mathematics 2025-06-11 Thomas Creutzig , Andrew R. Linshaw , Shigenori Nakatsuka , Ryo Sato

Billey-Postnikov (BP) decompositions govern when Schubert varieties $X(w)$ decompose as bundles of smaller Schubert varieties. We further develop the theory of BP decompositions and show that, in finite type, they can be recognized by…

Combinatorics · Mathematics 2025-12-10 Christian Gaetz , Yibo Gao

Following the pioneering work of Duistermaat and Gr\"unbaum, we call a family $\{p_n(x)\}_{n=0}^{\infty}$ of polynomials bispectral, if the polynomials are simultaneously eigenfunctions of two commutative algebras of operators: one…

Quantum Algebra · Mathematics 2014-01-15 Plamen Iliev

The central conjecture of parameterized complexity states that FPT is not equal to W[1], and is generally regarded as the parameterized counterpart to P != NP. We revisit the issue of the plausibility of FPT != W[1], focusing on two…

Computational Complexity · Computer Science 2018-07-20 Ralph C. Bottesch

A Goellnitz-Gordon partition is one in which the parts differ by at least 2, and where the inequality is strict if a part is even. Let Q_i(n) denote the number of partitions of n into distinct parts not congruent to i mod 4. By attaching…

Combinatorics · Mathematics 2007-05-23 Krishnaswami Alladi , Alexander Berkovich

In this note we conjecture Rogers-Ramanujan type colored partition identities for an array with odd number of rows w such that the first and the last row consist of even positive integers. In a strange way this is different from the…

Combinatorics · Mathematics 2023-01-31 Mirko Primc

We study classes of objects whose combinatorics are closely related to those of posets. The framework of operads and operad algebras allows us to make this relationship precise and provides tools for a deeper understanding of their…

Combinatorics · Mathematics 2026-04-28 José Antonio Arciniega-Nevárez , Marko Berghoff , Eric Rubiel Dolores-Cuenca

The pinched Veronese poset $V^*_n$ is the poset with ground set consisting of all non-negative integer vectors of length n such that the sum of their coordinates is divisible by $n$ with exception of the vector $(1,...,1)$. For two vectors…

Combinatorics · Mathematics 2014-02-25 Martin Tancer

We introduce families of two-parameter multivariate polynomials indexed by pairs of partitions $v,w$ -- biaxial double $(\beta,q)$-Grothendieck polynomials -- which specialize at $q=0$ and $v=1$ to double $\beta$-Grothendieck polynomials…

Combinatorics · Mathematics 2021-09-13 Ben Brubaker , Claire Frechette , Andrew Hardt , Emily Tibor , Katherine Weber

We prove the computability of a version of Whitney Extension, when the input is suitably represented. More specifically, if $F \subseteq \mathbb{R}^n$ is a closed set represented so that the distance function $x \mapsto d(x,F)$ can be…

Logic · Mathematics 2026-04-07 Andrea Brun , Guido Gherardi , Alberto Marcone
‹ Prev 1 3 4 5 6 7 10 Next ›