English
Related papers

Related papers: Canonical Decompositions of Affine Permutations, A…

200 papers

Motivated by $T\bar T$, we introduce and study a wide class of solvable deformations of quantum-mechanical theories. These deformations map the Hamiltonian to a function of itself. We solve these theories by computing all finite-temperature…

High Energy Physics - Theory · Physics 2020-09-09 David J. Gross , Jorrit Kruthoff , Andrew Rolph , Edgar Shaghoulian

We analyze integral representation and $\Gamma$-convergence properties of functionals defined on \emph{piecewise rigid functions}, i.e., functions which are piecewise affine on a Caccioppoli partition where the derivative in each component…

Analysis of PDEs · Mathematics 2020-02-04 Manuel Friedrich , Francesco Solombrino

We apply harmonic analysis to study the $T\bar{T}$-deformed torus partition function. We first express the CFT partition functions in terms of Maass waveforms, including the Eisenstein series and cusp forms. These basis functions turn out…

High Energy Physics - Theory · Physics 2026-05-06 Jie Gu , Jue Hou , Yunfeng Jiang

Polynomial reproduction plays a relevant role in deriving error estimates for various approximation schemes. Local reproduction in a quasi-uniform setting is a significant factor in the estimation of error and the assessment of stability…

Numerical Analysis · Mathematics 2024-11-25 Stefano De Marchi , Giacomo Cappellazzo

We derive decomposition formulas for supercharacters of quantum affine ortho-symplectic superalgebras and twisted quantum affine superalgebras into supercharacters of their finite-type quantum sub-superalgebras, by employing Cauchy-type…

Mathematical Physics · Physics 2026-03-24 Zengo Tsuboi

We introduce alphabet-permutation (AP) codes, a new family of error-correcting codes defined by iteratively applying random coordinate-wise permutations to a fixed initial word. A special case recovers random additive codes and random…

Information Theory · Computer Science 2025-05-12 Sergey Komech , Jonathan Mosheiff

Folded Reed-Solomon (FRS) codes are variants of Reed-Solomon codes, known for their optimal list decoding radius. We show explicit FRS codes with rate $R$ that can be list decoded up to radius $1-R-\epsilon$ with lists of size…

Information Theory · Computer Science 2024-10-14 Shashank Srivastava

We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple…

We study partial fraction decompositions (PFDs) in several variables using tools from commutative algebra. We give criteria for when a rational function with poles on a hyperplane arrangement has a desirable PFD. Our criteria are obtained…

Commutative Algebra · Mathematics 2026-03-25 Claire de Korte , Teresa Yu

The extended L\"uroth's Theorem says that if the transcendence degree of $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)/\KK$ is 1 then there exists $f \in \KK(\underline{X})$ such that $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)$ is equal to $\KK(f)$. In…

Symbolic Computation · Computer Science 2011-11-08 Guillaume Chèze

We introduce the notion of the stopping redundancy hierarchy of a linear block code as a measure of the trade-off between performance and complexity of iterative decoding for the binary erasure channel. We derive lower and upper bounds for…

Information Theory · Computer Science 2016-11-15 Thorsten Hehn , Olgica Milenkovic , Stefan Laendner , Johannes B. Huber

In this paper, we introduce Schubert decompositions for quiver Grassmannians and investigate example classes of quiver Grassmannians with a Schubert decomposition into affine spaces. The main theorem puts the cells of a Schubert…

Algebraic Geometry · Mathematics 2013-03-29 Oliver Lorscheid

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…

Data Structures and Algorithms · Computer Science 2007-05-23 Kevin K. H. Cheung , Michele Mosca

Let F be a non-Archimedean locally compact field of residue characteristic p, let G be an inner form of GL(n,F) with n>0, and let l be a prime number different from p. We describe the block decomposition of the category of finite length…

Representation Theory · Mathematics 2022-04-28 Bastien Drevon , Vincent Sécherre

In this short note, inspired by much recent activity centered around attempts to formulate various correspondences between the classification of affine SU(k) WZW modular-invariant partition functions and that of discrete finite subgroups of…

High Energy Physics - Theory · Physics 2007-05-23 Bo Feng , Yang-Hui He

This paper extends the classical Ostrogradsky-Hermite reduction for rational functions to more general functions in primitive extensions of certain types. For an element $f$ in such an extension $K$, the extended reduction decomposes $f$ as…

Symbolic Computation · Computer Science 2018-02-08 Shaoshi Chen , Hao Du , Ziming Li

We establish a novel bijective encoding that represents permutations as forests of decorated (or enriched) trees. This allows us to prove local convergence of uniform random permutations from substitution-closed classes satisfying a…

Probability · Mathematics 2020-07-01 Jacopo Borga , Mathilde Bouvel , Valentin Féray , Benedikt Stufler

Given a homogeneous component of an exterior algebra, we characterize those subspaces in which every nonzero element is decomposable. In geometric terms, this corresponds to characterizing the projective linear subvarieties of the Grassmann…

Algebraic Geometry · Mathematics 2009-03-31 Sudhir R. Ghorpade , Arunkumar R. Patil , Harish K. Pillai

The asymptotic study of the conjugacy classes of a random element of the finite affine group leads one to define a probability measure on the set of all partitions of all positive integers. Four different probabilistic understandings of…

Group Theory · Mathematics 2007-05-23 Jason Fulman

The main problem in theoretical analysis of structures with strong confinement is the fact that standard mathematical tools: differential equations and Fourier's transformations are no longer applicable. In this paper we have demonstrated…

Materials Science · Physics 2016-08-14 Jovan P. Šetrajčić