Related papers: Evaluating Multiple Polylogarithm Values at Sixth …
We use the Poincar\'e series method to compute gravity partition functions associated to SU(N) level 1 WZW models with arbitrarily large numbers of modular invariants. The result is an average over these invariants, with the weights being…
A weighted bicolored plane tree is a bicolored plane tree whose edges are endowed with positive integral weights. The degree of a vertex is defined as the sum of the weights of the edges incident to this vertex. Using the theory of dessins…
We present six Theorems on the univariate real Polynomial, using which we develop a new algorithm for deciding the existence of atleast one real root for univariate integer Polynomials. Our algorithm outputs that no positive real root…
We give new proofs of MacMahon and Russell's modulo 6 identities using the method of weighted words. We also present a new refinement of MacMahon's identity, some related finite sum identities, and a companion partition theorem to sequence…
Multiple polylogarithms are periods of variations of mixed Tate motives. Conjecturally, they deliver all such periods. We introduce deformations of multiple polylogarithms depending on a complex parameter h. We call them quantum…
For the class of polynomial quadrature rules we show that conveniently chosen bases allow to compute both the weights and the theoretical error expression of a $n$-point rule via the undetermined coefficients method. As an illustration, the…
In this article, we discuss sixth-order and seventh-order iterative methods for nonlinear equations. Derivative-based and derivative-free, both categories are presented for said iterative methods. Especially sixth-order derivative-based and…
This article investigates the two-parameter quantum matrix algebra at roots of unity. In the roots of unity setting, this algebra becomes a Polynomial Identity (PI) algebra and it is known that simple modules over such algebra are…
We initiate a study of varieties of minimal degree in weighted projective spaces. We call a weighted projective space $\mathbf{P}(w_0,\dots,w_n)$ divisible if $w_i \mid w_{i+1}$ for all $i$. We provide sharp bounds for when a non-degenerate…
A unified approach to the construction of weighing matrices and certain symmetric designs is presented. Assuming the weight $p$ in a weighing matrix $W(n,p)$ is a prime power, it is shown that there is a…
The special values of multiple polylogarithms, which including multiple zeta values, appear some fields of mathematics and physics. Many kinds of their linear relations are investigated as well as their algebraic relations. From the…
For real polynomials with (sparse) exponents in some fixed set, \[ \Psi(t)=x+y_1t^{k_1}+\ldots +y_L t^{k_L}, \] we analyse the types of root structures that might occur as the coefficients vary. We first establish a stratification of roots…
A digraph $G$ is weightable if its edges can be weighted with real numbers such that the total weight in each directed cycle equals 1. There are several equivalent conditions: that $G$ admits a 0/1-weighting with the same property, or that…
We give an algorithm to compute weighted Ehrhart functions of lattice polytopes for polynomial weights using Lagrange interpolation. We show how to compute generating functions of polynomials using those of unit cubes and Eulerian numbers,…
We describe a new incomplete but terminating method for real root finding for large multivariate polynomials. We take an abstract view of the polynomial as the set of exponent vectors associated with sign information on the coefficients.…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
We study six-dimensional N=(1,0) supergravity theories with abelian, as well as non-abelian, gauge group factors. We show that for theories with fewer than nine tensor multiplets, the number of possible combinations of gauge groups -…
Linear codes with a few weights can be applied to secrete sharing, authentication codes, association schemes and strongly regular graphs. For an odd prime power $q$, we construct a class of three-weight $\F_q$-linear codes from quadratic…
The Assmus-Mattson theorem gives a way to identify block designs arising from codes. This result was broadened to matroids and weighted designs. In this work we present a further two-fold generalisation: first from matroids to polymatroids…
In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…