Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Complexity and asymptotics of structure constants
G Panova - arxiv preprint arxiv:2305.02553, 2023 - arxiv.org
Kostka, Littlewood-Richardson, Kronecker, and plethysm coefficients are fundamental
quantities in algebraic combinatorics, yet many natural questions about them stay …
quantities in algebraic combinatorics, yet many natural questions about them stay …
Computational complexity in algebraic combinatorics
G Panova - arxiv preprint arxiv:2306.17511, 2023 - arxiv.org
Algebraic Combinatorics originated in Algebra and Representation Theory, studying their
discrete objects and integral quantities via combinatorial methods which have since …
discrete objects and integral quantities via combinatorial methods which have since …
Bounds on Kronecker coefficients via contingency tables
We present both upper and lower bounds for the Kronecker coefficients and the reduced
Kronecker coefficients, in term of the number of certain contingency tables. Various …
Kronecker coefficients, in term of the number of certain contingency tables. Various …
Independent sets of a given size and structure in the hypercube
We determine the asymptotics of the number of independent sets of size in the discrete
hypercube for any fixed as, extending a result of Galvin for. Moreover, we prove a …
hypercube for any fixed as, extending a result of Galvin for. Moreover, we prove a …
Matrix models for classical groups and Toeplitz±Hankel minors with applications to Chern–Simons theory and fermionic models
We study matrix integration over the classical Lie groups U (N), Sp (2N), SO (2N) and SO
(2N+ 1), using symmetric function theory and the equivalent formulation in terms of …
(2N+ 1), using symmetric function theory and the equivalent formulation in terms of …
Durfee squares, symmetric partitions and bounds on Kronecker coefficients
We resolve two open problems on Kronecker coefficients g (λ, μ, ν) of the symmetric group.
First, we prove that for partitions λ, μ, ν with fixed Durfee square size, the Kronecker …
First, we prove that for partitions λ, μ, ν with fixed Durfee square size, the Kronecker …
Non-Abelian phases from the condensation of Abelian anyons
The observed fractional quantum Hall (FQH) plateaus follow a recurring hierarchical
structure that allows an understanding of complex states based on simpler ones …
structure that allows an understanding of complex states based on simpler ones …
Maximum entropy and integer partitions
We derive asymptotic formulas for the number of integer partitions with given sums of $ j $ th
powers of the parts for $ j $ belonging to a finite, non-empty set $ J\subset\mathbb N $. The …
powers of the parts for $ j $ belonging to a finite, non-empty set $ J\subset\mathbb N $. The …
Query complexity of inversion minimization on trees
I Hu, D van Melkebeek, A Morgan - Proceedings of the 2023 Annual ACM …, 2023 - SIAM
We consider the following computational problem: Given a rooted tree and a ranking of its
leaves, what is the minimum number of inversions of the leaves that can be attained by …
leaves, what is the minimum number of inversions of the leaves that can be attained by …
Kleinian singularities: some geometry, combinatorics and representation theory
We review the relationship between discrete groups of symmetries of Euclidean three-
space, constructions in algebraic geometry around Kleinian singularities including versions …
space, constructions in algebraic geometry around Kleinian singularities including versions …