BZPEERPapers, people, evidence and research paths
Menu

Discover

SearchFind papers, people, topics, institutions and opportunities from one place.GraphSee how papers, authors, topics and evidence connect.

Research tools

HomeContinue from the papers, people and topics that matter now.CollectionsTurn saved papers into reading lists, evidence maps and shareable context.ResearchReconstruct the path that led you from search to paper to question.CollaborationMove from a paper, topic or expert request into a focused thread.PublishCreate full-text research articles with metadata, formulas and versions.

Network

ExpertsFind specialists whose work and reviews explain why they can help.CommunitiesJoin research groups organized around papers, topics and shared evidence.

Opportunities

ListingsBrowse roles, calls and collaborations connected to real research context.

Account

Log inReturn to your saved papers, graph views and active threads.Create accountStart saving papers, building a research trail and joining teams.
Log inCreate account

Source author record

Greta Panova

Greta Panova appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record
math.COmath.RTmath.PRArtificial IntelligenceComputation and LanguageComputational ComplexityDiscrete MathematicsMachine Learningmath-phmath.GRmath.MPmath.NA

Catalog footprint

What is connected

23works
12topics
4close collaborators

Actions

Connect this record

Log in to claim
Open graphBrowse works

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

23 published item(s)

preprint2026arXiv

Soohak: A Mathematician-Curated Benchmark for Evaluating Research-level Math Capabilities of LLMs

Following the recent achievement of gold-medal performance on the IMO by frontier LLMs, the community is searching for the next meaningful and challenging target for measuring LLM reasoning. Whereas olympiad-style problems measure step-by-step reasoning alone, research-level problems use such reasoning to advance the frontier of mathematical knowledge itself, emerging as a compelling alternative. Yet research-level math benchmarks remain scarce because such problems are difficult to source (e.g., Riemann Bench and FrontierMath-Tier 4 contain 25 and 50 problems, respectively). To support reliable evaluation of next-generation frontier models, we introduce Soohak, a 439-problem benchmark newly authored from scratch by 64 mathematicians. Soohak comprises two subsets. On the Challenge subset, frontier models including Gemini-3-Pro, GPT-5, and Claude-Opus-4.5 reach 30.4%, 26.4%, and 10.4% respectively, leaving substantial headroom, while leading open-weight models such as Qwen3-235B, GPT-OSS-120B, and Kimi-2.5 remain below 15%. Notably, beyond standard problem solving, Soohak introduces a refusal subset that probes a capability intrinsic to research mathematics: recognizing ill-posed problems and pausing rather than producing confident but unjustified answers. On this subset, no model exceeds 50%, identifying refusal as a new optimization target that current models do not directly address. To prevent contamination, the dataset will be publicly released in late 2026, with model evaluations available upon request in the interim.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Trees and Graphs with Non Log-concave Dominating Set Sequence via AI Tools

We give new examples of graphs and trees with dominating set sequences that are not log-concave. These examples were generated by PatternBoost, a transformer-based reinforcement learning software developed by Charton-Ellenberg-Wagner-Williamson. We also show: for any positive integer $m$, there exists a tree whose dominating set sequence is not log-concave for at least $m$ indices by modifying a similar construction of Bautista-Ramos for the independent set sequence. We show that a large class of caterpillar graphs has log-concave dominating set sequences. A continuous analogue of the sequence is also log-concave for all graphs.

0 citations0 reviewsNo code linkedOpen access
preprint2023arXiv

Chromatic symmetric functions of Dyck paths and q-rook theory

The chromatic symmetric function (CSF) of Dyck paths of Stanley and its Shareshian-Wachs $q$-analogue have important connections to Hessenberg varieties, diagonal harmonics and LLT polynomials. In the, so called, abelian case they are also curiously related to placements of non-attacking rooks by results of Stanley-Stembridge (1993) and Guay-Paquet (2013). For the $q$-analogue, these results have been generalized by Abreu-Nigro (2020) and Guay-Paquet (private communication), using $q$-hit numbers. Among our main results is a new proof of Guay-Paquet's elegant identity expressing the $q$-CSFs in a CSF basis with $q$-hit coefficients. We further show its equivalence to the Abreu-Nigro identity expanding the $q$-CSF in the elementary symmetric functions. In the course of our work we establish that the $q$-hit numbers in these expansions differ from the originally assumed Garsia-Remmel $q$-hit numbers by certain powers of $q$. We prove new identities for these $q$-hit numbers, and establish connections between the three different variants.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Breaking down the reduced Kronecker coefficients

We resolve three interrelated problems on \emph{reduced Kronecker coefficients} $\overline{g}(α,β,γ)$. First, we disprove the \emph{saturation property} which states that $\overline{g}(Nα,Nβ,Nγ)>0$ implies $\overline{g}(α,β,γ)>0$ for all $N>1$. Second, we esimate the maximal $\overline{g}(α,β,γ)$, over all $|α|+|β|+|γ| = n$. Finally, we show that computing $\overline{g}(λ,μ,ν)$ is strongly $\# P$-hard, i.e. $\#P$-hard when the input $(λ,μ,ν)$ is in unary.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Hook formulas for skew shapes II. Combinatorial proofs and enumerative applications

The Naruse hook-length formula is a recent general formula for the number of standard Young tableaux of skew shapes, given as a positive sum over excited diagrams of products of hook-lengths. In 2015 we gave two different $q$-analogues of Naruse's formula: for the skew Schur functions, and for counting reverse plane partitions of skew shapes. In this paper we give an elementary proof of Naruse's formula based on the case of border strips. For special border strips, we obtain curious new formulas for the Euler and $q$-Euler numbers in terms of certain Dyck path summations.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Hook formulas for skew shapes III. Multivariate and product formulas

We give new product formulas for the number of standard Young tableaux of certain skew shapes and for the principal evaluation of the certain Schubert polynomials. These are proved by utilizing symmetries for evaluations of factorial Schur functions, extensively studied in the first two papers in the series "Hook formulas for skew shapes" [arxiv:1512.08348, arxiv:1610.04744]. We also apply our technology to obtain determinantal and product formulas for the partition function of certain weighted lozenge tilings, and give various probabilistic and asymptotic applications.

0 citations0 reviewsNo code linkedOpen access
preprint2016arXiv

Bounds on Kronecker and $q$-binomial coefficients

We present a lower bound on the Kronecker coefficients for tensor squares of the symmetric group via the characters of~$S_n$, which we apply to obtain various explicit estimates. Notably, we extend Sylvester's unimodality of $q$-binomial coefficients $\binom{n}{k}_q$ as polynomials in~$q$ to derive sharp bounds on the differences of their consecutive coefficients. We then derive effective asymptotic lower bounds for a wider class of Kronecker coefficients.

0 citations0 reviewsNo code linkedOpen access
preprint2015arXiv

Asymptotics of symmetric polynomials with applications to statistical mechanics and representation theory

We develop a new method for studying the asymptotics of symmetric polynomials of representation-theoretic origin as the number of variables tends to infinity. Several applications of our method are presented: We prove a number of theorems concerning characters of infinite-dimensional unitary group and their $q$-deformations. We study the behavior of uniformly random lozenge tilings of large polygonal domains and find the GUE-eigenvalues distribution in the limit. We also investigate similar behavior for alternating sign matrices (equivalently, six-vertex model with domain wall boundary conditions). Finally, we compute the asymptotic expansion of certain observables in $O(n=1)$ dense loop model.

0 citations0 reviewsNo code linkedOpen access
preprint2015arXiv

Lozenge tilings with free boundaries

We study lozenge tilings of a domain with partially free boundary. In particular, we consider a trapezoidal domain (half hexagon), s.t. the horizontal lozenges on the long side can intersect it anywhere to protrude halfway across. We show that the positions of the horizontal lozenges near the opposite flat vertical boundary have the same joint distribution as the eigenvalues from a Gaussian Unitary Ensemble (the GUE-corners/minors process). We also prove the existence of a limit shape of the height function, which is also a vertically symmetric plane partition. Both behaviors are shown to coincide with those of the corresponding doubled fixed-boundary hexagonal domain. We also consider domains where the different sides converge to $\infty$ at different rates and recover again the GUE-corners process near the boundary.

0 citations0 reviewsNo code linkedOpen access
preprint2015arXiv

On the complexity of computing Kronecker coefficients

We study the complexity of computing Kronecker coefficients $g(λ,μ,ν)$. We give explicit bounds in terms of the number of parts $\ell$ in the partitions, their largest part size $N$ and the smallest second part $M$ of the three partitions. When $M = O(1)$, i.e. one of the partitions is hook-like, the bounds are linear in $\log N$, but depend exponentially on $\ell$. Moreover, similar bounds hold even when $M=e^{O(\ell)}$. By a separate argument, we show that the positivity of Kronecker coefficients can be decided in $O(\log N)$ time for a bounded number $\ell$ of parts and without restriction on $M$. Related problems of computing Kronecker coefficients when one partition is a hook, and computing characters of $S_n$ are also considered.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

Bounds on the Kronecker coefficients

We present several upper and lower bounds on the Kronecker coefficients of the symmetric group. We prove $k$-stability of the Kronecker coefficients generalizing the (usual) stability, and giving a new upper bound. We prove a lower bound via the characters of $S_n$. We apply these and other results to generalize Sylvester's unimodality of the $q$-binomial coefficients $\binom{n}{k}_q$ as polynomials in $q$: we derive explicit sharp bounds on the differences of their consecutive coefficients.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

Schur times Schubert via the Fomin-Kirillov algebra

We study multiplication of any Schubert polynomial $\mathfrak{S}_w$ by a Schur polynomial $s_λ$ (the Schubert polynomial of a Grassmannian permutation) and the expansion of this product in the ring of Schubert polynomials. We derive explicit nonnegative combinatorial expressions for the expansion coefficients for certain special partitions $λ$, including hooks and the 2x2 box. We also prove combinatorially the existence of such nonnegative expansion when the Young diagram of $λ$ is a hook plus a box at the (2,2) corner. We achieve this by evaluating Schubert polynomials at the Dunkl elements of the Fomin-Kirillov algebra and proving special cases of the nonnegativity conjecture of Fomin and Kirillov. This approach works in the more general setup of the (small) quantum cohomology ring of the complex flag manifold and the corresponding (3-point) Gromov-Witten invariants. We provide an algebro-combinatorial proof of the nonnegativity of the Gromov-Witten invariants in these cases, and present combinatorial expressions for these coefficients.

0 citations0 reviewsNo code linkedOpen access
preprint2014arXiv

Unimodality via Kronecker products

We present new proofs and generalizations of unimodality of the q-binomial coefficients \binom{n}{k}_q as polynomials in q. We use an algebraic approach by interpreting the differences between numbers of certain partitions as Kronecker coefficients of representations of S_n. Other applications of this approach include strict unimodality of the diagonal q-binomial coefficients and unimodality of certain partition statistics.

0 citations0 reviewsNo code linkedOpen access
preprint2013arXiv

Dyck tilings, increasing trees, descents, and inversions

Cover-inclusive Dyck tilings are tilings of skew Young diagrams with ribbon tiles shaped like Dyck paths, in which tiles are no larger than the tiles they cover. These tilings arise in the study of certain statistical physics models and also Kazhdan--Lusztig polynomials. We give two bijections between cover-inclusive Dyck tilings and linear extensions of tree posets. The first bijection maps the statistic (area + tiles)/2 to inversions of the linear extension, and the second bijection maps the "discrepancy" between the upper and lower boundary of the tiling to descents of the linear extension.

0 citations0 reviewsNo code linkedOpen access
preprint2012arXiv

Factorization of banded permutations

We consider the factorization of permutations into bandwidth 1 permutations, which are products of mutually nonadjacent simple transpositions. We exhibit an upper bound on the minimal number of such factors and thus prove a conjecture of Gilbert Strang: a banded permutation of bandwidth $w$ can be represented as the product of at most $2w-1$ permutations of bandwidth 1. An analogous result holds also for infinite and cyclically banded permutations.

0 citations0 reviewsNo code linkedOpen access
preprint2012arXiv

Matrices with restricted entries and q-analogues of permutations

We study the functions that count matrices of given rank over a finite field with specified positions equal to zero. We show that these matrices are $q$-analogues of permutations with certain restricted values. We obtain a simple closed formula for the number of invertible matrices with zero diagonal, a $q$-analogue of derangements, and a curious relationship between invertible skew-symmetric matrices and invertible symmetric matrices with zero diagonal. In addition, we provide recursions to enumerate matrices and symmetric matrices with zero diagonal by rank, and we frame some of our results in the context of Lie theory. Finally, we provide a brief exposition of polynomiality results for enumeration questions related to those mentioned, and give several open questions.

0 citations0 reviewsNo code linkedOpen access
preprint2012arXiv

Polynomiality of some hook-length statistics

We prove a conjecture of Okada giving an exact formula for a certain statistic for hook-lengths of partitions: \frac{1}{n!} \sum_{λ\vdash n} f_λ^2 \sum_{u \in λ} \prod_{i=1}^{r}(h_u^2 - i^2) = \frac{1}{2(r+1)^2} \binom{2r}{r}\binom{2r+2}{r+1} \prod_{j=0}^{r} (n-j), where $f_λ$ is the number of standard Young tableaux of shape $λ$ and $h_u$ is the hook length of the square $u$ of the Young diagram of $λ$. We also obtain other similar formulas.

0 citations0 reviewsNo code linkedOpen access
preprint2012arXiv

Tableaux and plane partitions of truncated shapes

We consider a new kind of straight and shifted plane partitions/Young tableaux --- ones whose diagrams are no longer of partition shape, but rather Young diagrams with boxes erased from their upper right ends. We find formulas for the number of standard tableaux in certain cases, namely a shifted staircase without the box in its upper right corner, i.e. truncated by a box, a rectangle truncated by a staircase and a rectangle truncated by a square minus a box. The proofs involve finding the generating function of the corresponding plane partitions using interpretations and formulas for sums of restricted Schur functions and their specializations. The number of standard tableaux is then found as a certain limit of this function.

0 citations0 reviewsNo code linkedOpen access
preprint2010arXiv

Bijective enumeration of permutations starting with a longest increasing subsequence

We prove a formula for the number of permutations in $S_n$ such that their first $n-k$ entries are increasing and their longest increasing subsequence has length $n-k$. This formula first appeared as a consequence of character polynomial calculations in recent work of Adriano Garsia and Alain Goupil. We give two `elementary' bijective proofs of this result and of its $q$-analogue, one proof using the RSK correspondence and one only permutations.

0 citations0 reviewsNo code linkedOpen access