Related papers: Hunt for 3-Schur polynomials
The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.
The square of a graph $G$, denoted $G^2$, is obtained from $G$ by putting an edge between two distinct vertices whenever their distance is two. Then $G$ is called a square root of $G^2$. Deciding whether a given graph has a square root is…
The works presented in this habilitation concern the algorithmics of polynomials. This is a central topic in computer algebra, with numerous applications both within and outside the field - cryptography, error-correcting codes, etc. For…
Let $\mathscr{S}$ denote the set of integer partitions into parts that differ by at least $3$, with the added constraint that no two consecutive multiples of $3$ occur as parts. We derive trivariate generating functions of Andrews--Gordon…
Let $W$ denote a matrix $A_2$ weight. In this paper, we implement a scalar argument using the square function to deduce square-function type results for vector-valued functions in $L^2(\mathbb{R},\mathbb{C}^d)$. These results are then used…
A general class of W-algebras can be constructed from the affine sl(N) algebra by (quantum) Drinfeld-Sokolov reduction and are classified by partitions of N. Surface operators in an N=2 SU(N) 4d gauge theory are also classified by…
The objective of this study is to ascertain the existence and forms of the finite order meromorphic and entire functions of several complex variables satisfying some certain Fermat-type partial differential-difference equations by…
We consider a planar graph $G$ in which the edges have nonnegative integer lengths such that the length of every cycle of $G$ is even, and three faces are distinguished, called holes in $G$. It is known that there exists a packing of cuts…
We present recent analytic results for the 3-loop corrections to the massive operator matrix element $A_{Qg}^{(3)}$for further color factors. These results have been obtained using the method of arbitrarily large moments. We also give an…
In this paper, we examine Yangjun Chen's technical report titled ``The 2-MAXSAT Problem Can Be Solved in Polynomial Time'' [Che23], which revises and expands upon their conference paper of the same name [Che22]. Chen's paper purports to…
Classical A-polynomials $A(\ell,m)$ define constraints on coordinates $\ell$ and $m$ in $SL(2,\mathbb{C})$ (a complexification of $SU(2)$) character varieties associated to knot complements $S^3\setminus K$. Quantum A-polynomials $\hat…
Covariance functions and variograms play a fundamental role in exploratory analysis and statistical modelling of spatial and spatio-temporal datasets. In this paper, we construct a new class of spatial covariance functions using the Fourier…
We present a study of three families of Kronecker coefficients, which we describe in terms of reduced Kronecker coefficients. This study is grounded on the generating function of the coefficients, proved by a bijection between two…
Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, two conjectures on permutation polynomials proposed recently by Wu and Li [19] are…
This paper begins with a class of convex quadratic programs (QPs) with bounded variables solvable by the parametric principal pivoting algorithm with $\mathcal{O}(n^3)$ strongly polynomial complexity, where $n$ is the number of variables of…
Strict partitions are enumerated with respect to the weight, the number of parts, and the number of sequences of odd length. We write this trivariate generating function as a double sum $q$-series. Equipped with such a combinatorial set-up,…
We give the fermionic character formulas for the spaces of coinvariants obtained from level $k$ integrable representations of $\hat{\mathfrak sl}_2$. We establish the functional realization of the spaces dual to the coinvariant spaces. We…
We propose a polynomially bounded, in time and space, method to decide whether a given 3-SAT formula is satisfiable or not. The tools we use here are, in fact, very simple. We first decide satisfiability for a particular 3-SAT formula,…
We associate to a semisimple complex Lie algebra $\mathfrak{g}$ a sequence of polynomials $P_{\ell,\mathfrak{g}}(x)\in\mathbb{Q}[x]$ in $r$ variables, where $r$ is the rank of $\mathfrak{g}$ and $\ell=0,1,2,\ldots $. The polynomials…
Fast algorithms for arithmetic on real or complex polynomials are well-known and have proven to be not only asymptotically efficient but also very practical. Based on Fast Fourier Transform (FFT), they for instance multiply two polynomials…