Related papers: Hunt for 3-Schur polynomials
We present subquadratic algorithms in the algebraic decision-tree model for several \textsc{3Sum}-hard geometric problems, all of which can be reduced to the following question: Given two sets $A$, $B$, each consisting of $n$ pairwise…
We consider algorithms for the factorization of linear partial differential operators. We introduce several new theoretical notions in order to simplify such considerations. We define an obstacle and a ring of obstacles to factorizations.…
This paper is devoted to the study of general (Laurent) polynomial modifications of moment functionals on the unit circle, i.e., associated with hermitian Toeplitz matrices. We present a new approach which allows us to study polynomial…
A set of functions is introduced which generalizes the famous Schur polynomials and their connection to Grasmannian manifolds. These functions are shown to provide a new method of constructing solutions to the KP hierarchy of nonlinear…
3D (3 dimensional) Young diagrams are a generalization of 2D Young diagrams. In this paper, We consider 3D Bosons and 3-Jack polynomials. We associate three parameters $h_1,h_2,h_3$ to $y,x,z$-axis respectively. 3-Jack polynomials are…
The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
Let $(W,S)$ be a finite Coxeter system with root system $R$ and with set of positive roots $R^+$. For $\alpha\in R$, $v,w\in W$, we denote by $\partial_\alpha$, $\partial_w$ and $\partial_{w/v}$ the divided difference operators and skew…
Schur's $Q$-functions with reduced variables are discussed by employing a combinatorics of strict partitions. They are called reduced $Q$-functions. We give a description of the linear relations among reduced $Q$-functions.
In 2015, Guth proved that for any set of $k$-dimensional bounded complexity varieties in $\mathbb{R}^d$ and for any positive integer $D$, there exists a polynomial of degree at most $D$ whose zero set divides $\mathbb{R}^d$ into open…
Three-term recurrences have infused stupendous amount of research in a broad spectrum of the sciences, such as orthogonal polynomials (in special functions) and lattice paths (in enumerative combinatorics). Among these are the Lucas…
We study here several variants of the covariates fine balance problem where we generalize some of these problems and introduce a number of others. We present here a comprehensive complexity study of the covariates problems providing…
Every element $w$ in the commutator subgroup of the free group $\mathbb{F}_2$ of rank 2 determines a closed curve in the grid $\mathbb{Z} \times \mathbb{R} \cup \mathbb{R} \times \mathbb{Z} \subseteq \mathbb{R}^2$. The winding numbers of…
We extend the close interplay between continued fractions, orthogonal polynomials, and Gaussian quadrature rules to several variables in a special but natural setting which we characterize in terms of moment sequences. The crucial condition…
Chen and Ruan [6] defined a very interesting cohomology theory for orbifolds, which is now called Chen-Ruan cohomology. The primary objective of this paper is to compute the Chen-Ruan cohomology rings of the weighted projective spaces, a…
In a recent work, Nadji and Ahmia introduced the $t$-Schur overpartitions as an overpartition analogue for $t$-Schur partitions, which generalizes the classical Schur's partitions into parts congruent to $1$ or $5$ modulo $6$. We continue…
Motivated by applications in robotics and computer vision, we study problems related to spatial reasoning of a 3D environment using sublevel sets of polynomials. These include: tightly containing a cloud of points (e.g., representing an…
The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…
The Jack symmetric polynomials $P_\lambda^{(\alpha)}$ form a class of symmetric polynomials which are indexed by a partition $\lambda$ and depend rationally on a parameter $\alpha$. They reduced to the Schur polynomials when $\alpha=1$, and…
The Macdonald polynomials expanded in terms of a modified Schur function basis have coefficients called the $q,t$-Kostka polynomials. We define operators to build standard tableaux and show that they are equivalent to creation operators…