Related papers: Hunt for 3-Schur polynomials
This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running…
General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…
Ritt-Wu's algorithm of characteristic sets is the most representative for triangularizing sets of multivariate polynomials. Pseudo-division is the main operation used in this algorithm. In this paper we present a new algorithmic scheme for…
We lay the foundations of a new theory for algorithms and computational complexity by parameterizing the instances of a computational problem as a moduli scheme. Considering the geometry of the scheme associated to 3-SAT, we separate P and…
We give new algorithms based on the sum-of-squares method for tensor decomposition. Our results improve the best known running times from quasi-polynomial to polynomial for several problems, including decomposing random overcomplete…
In this note, we establish an analog of the Mallows-Sloane bound for Type III formal weight enumerators. This completes the bounds for all types (Types I through IV) in synthesis of our previous results. Next we show by using the binomial…
We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…
Learning intersections of halfspaces is a central problem in Computational Learning Theory. Even for just two halfspaces, it remains a major open question whether learning is possible in polynomial time with respect to the margin $\gamma$…
The matrix-valued spherical functions for the pair (K x K, K), K=SU(2), are studied. By restriction to the subgroup A the matrix-valued spherical functions are diagonal. For suitable set of representations we take these diagonals into a…
We present a simple technique to compute moments of derivatives of unitary characteristic polynomials. The first part of the technique relies on an idea of Bump and Gamburd: it uses orthonormality of Schur functions over unitary groups to…
We define new compact matrix quantum groups whose intertwiner spaces are dual to tensor categories of three-dimensional set partitions -- which we call spatial partitions. This extends substantially Banica and Speicher's approach of the so…
In the paper, we investigate the uniqueness problem of entire functions concerning their linear differential polynomial in shift and obtain three results which improve and generalize the recent result due to Qi (Ann. Polon. Math., 102…
We study factorizations of operator valued functions of weighted Schur classes over multiply-connected domains. There is a correspondence between functions from weighted Schur classes and so-called ``conservative curved'' systems introduced…
We characterize the entire functions $P$ of $d$ variables, $d\ge 2,$ for which the $\mzd$-translates of $P\chi_{[0,N]^d}$ satisfy the partition of unity for some $N\in \mn.$ In contrast to the one-dimensional case, these entire functions…
Our results revolve around a new operation on partitions, which we call overlap. We prove two overlap identities for so-called Littlewood-Schur functions. Littlewood-Schur functions are a generalization of Schur functions, whose study was…
A multivariable hypergeometric-type formula for raising operators of the Macdonald polynomials is conjectured. It is proved that this agrees with Jing and Jozefiak's expression for the two-row Macdonald polynomials, and also with Lassalle…
We give upper bounds on the Walsh coefficients of functions for which the derivative of order at least one has bounded variation of fractional order. Further, we also consider the Walsh coefficients of functions in periodic and non-periodic…
We determine all permutation polynomials among several families of polynomials over $\mathbb{F}_{q^3}$ for arbitrary prime powers $q$. We obtain some new families of permutation polynomials over $\mathbb{F}_{q^3}$ with simple coefficients…
Schubert polynomials form a basis of all polynomials and appear in the study of cohomology rings of flag manifolds. The vanishing problem for Schubert polynomials asks if a coefficient of a Schubert polynomial is zero. We give a tableau…
We study an action of the skew divided difference operators on the Schubert polynomials and give an explicit formula for structural constants for the Schubert polynomials in terms of certain weighted paths in the Bruhat order on the…