English
Related papers

Related papers: On McMillan's theorem about uniquely decipherable …

200 papers

We provide new approaches to prove identities for the modified Macdonald polynomials via their LLT expansions. As an application, we prove a conjecture of Haglund concerning the multi-$t$-Macdonald polynomials of two rows.

Combinatorics · Mathematics 2023-02-15 Seung Jin Lee , Jaeseong Oh , Brendon Rhoades

This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…

Symbolic Computation · Computer Science 2021-04-12 Vincent Neiger , Clément Pernet

We show that combining two different hypothetical enhancements to quantum computation---namely, quantum advice and non-collapsing measurements---would let a quantum computer solve any decision problem whatsoever in polynomial time, even…

Quantum Physics · Physics 2018-05-23 Scott Aaronson

We study the copolynomials of $n$ variables, i.e. $K$-linear mappings from the ring of polynomials $K[x_1,...,x_n]$ into the commutative ring $K$. We prove an existence and uniqueness theorem for a linear differential equation of infinite…

Analysis of PDEs · Mathematics 2025-12-02 S. L. Gefter , A. L. Piven'

We recall a uniqueness theorem of E. B. Vul pertaining to a version of the cosine transform originating in spectral theory. Then we point out an application to the Bernstein approximation problem with non-symmetric weights: a theorem of…

Classical Analysis and ODEs · Mathematics 2021-09-28 Sasha Sodin

A term calculus for the proofs in multiplicative-additive linear logic is introduced and motivated as a programming language for channel based concurrency. The term calculus is proved complete for a semantics in linearly distributive…

Category Theory · Mathematics 2010-03-03 J. R. B. Cockett , C. A. Pastro

The graph reconstruction conjecture asserts that every simple graph on at least three vertices is uniquely determined by its deck of vertex-deleted subgraphs. In this expository article we survey the conjecture and present an…

Combinatorics · Mathematics 2026-04-21 Emilie Dufresne , Gabriela Jeronimo , Jenny Kenkel , Haydee Lindo , Nelly Villamizar

The crank-mex theorem states that the number of integer partitions of $n$ with nonnegative crank equals the number with odd minimal excludant (mex). Andrews and M. Newman recently refined that result in terms of the number of parts greater…

Combinatorics · Mathematics 2025-11-26 George E. Andrews , Brian Hopkins

In this paper we present characterizations of the sets of key polynomials and abstract key polynomials for a valuation $\mu$ of $K(x)$, in terms of (ultrametric) balls in the algebraic closure $\overline K$ of $K$ with respect to $v$, a…

Commutative Algebra · Mathematics 2026-01-30 Enric Nart , Josnei Novacoski , Giulio Peruginelli

In this article we furnish a new simple proof of a hard identity from the theory of cubature formulas via the method of coefficients.

Combinatorics · Mathematics 2012-02-15 Georgy P. Egorychev

In the theory of Lie groups, the irreducibility of a unitary representation is not preserved in general by restriction to a subgroup. Kirillov's conjecture says that it is preserved for the groups Gl(n,R) or Gl(n,C) when the subgroup is the…

Representation Theory · Mathematics 2009-10-16 Esther Galina , Yves Laurent

We derive an explicit formula for the intrinsic MacWilliams transform for permutation-invariant qudit codes. Such codes naturally live in symmetric power representations, where the relevant error sectors are determined by the irreducible…

Quantum Physics · Physics 2026-05-18 Ian Teixeira

Considering successive extensions of primary translationally shape invariant potentials, we enlarge the Krein-Adler theorem to mixed chains of state adding and state-deleting Darboux-B\"acklund transformations. It allows us to establish…

Exactly Solvable and Integrable Systems · Physics 2015-06-17 David Gómez-Ullate , Yves Grandati , Robert Milson

The PCP Theorem is one of the most stunning results in computational complexity theory, a culmination of a series of results regarding proof checking it exposes some deep structure of computational problems. As a surprising side-effect, it…

Computational Complexity · Computer Science 2012-07-30 Luke Mathieson

We prove a Hochschild-Kostant-Rosenberg theorem ("the HKR theorem") which computes the factorization homology of certain smooth commutative ring spectra. In doing so we fix and generalize a THH computation which was first conceived as the…

Algebraic Topology · Mathematics 2023-11-17 Hari Rau-Murthy

It is well known that the integral identity conjecture is of prime importance in Kontsevich-Soibelman's theory of motivic Donaldson-Thomas invariants for non-commutative Calabi-Yau threfolds. In this article we consider its numerical…

Algebraic Geometry · Mathematics 2012-12-11 Le Quy Thuong

The well known Andrews-Curtis Conjecture [2] is still open. In this paper, we establish its finite version by describing precisely the connected components of the Andrews-Curtis graphs of finite groups. This finite version has independent…

Group Theory · Mathematics 2011-03-08 Alexandre V. Borovik , Alexander Lubotzky , Alexei G. Myasnikov

In this article, we discuss a probabilistic interpretation of McShane's identity as describing a finite measure on the space of embedded paths though a point.

Differential Geometry · Mathematics 2017-07-25 Labourie François , Tan Ser Peow

This paper develops an infinitesimal order of magnitude coupled with overflow technique that allows nonnumerical proofs of nondegenerate and degenerate inverse mapping theorems for mappings minimally regular at a point. This approach is…

Analysis of PDEs · Mathematics 2012-07-23 Tom McGaffey

We prove Marchenko-type uniqueness theorems for inverse Sturm-Liouville problems. Moreover, we prove a generalization of Ambarzumyans theorem.

Spectral Theory · Mathematics 2017-09-04 Yuri Ashrafyan