Related papers: On the Reduction and Evaluation of Generalized Pol…
We compare algorithms for global optimization of polynomial functions in many variables. It is demonstrated that existing algebraic methods (Gr\"obner bases, resultants, homotopy methods) are dramatically outperformed by a relaxation…
We show how to reduce a general, strictly-feasible LP problem, into a min-max problem, which can be solved by the algorithm from the third section of my thesis.
In a recent paper (Appl. Math. Comput. 215, 1622--1645, 2009), the authors proposed a method of summation of some slowly convergent series. The purpose of this note is to give more theoretical analysis for this transformation, including the…
The harmonic polylogarithms (hpl's) are introduced. They are a generalization of Nielsen's polylogarithms, satisfying a product algebra (the product of two hpl's is in turn a combination of hpl's) and forming a set closed under the…
In the present paper, we define the new class of representation on $n$-Lie algebra that is called as generalized representation. We study the cohomology theory corresponding to generalized representations of $n$-Lie algebras and show its…
The original version of the paper was published in Contemporary Mathematics 378 ``Groups, Languages, Algorithms''; 2005, pp. 319-348. This is a modified version with Appendix that holds a corrected formulation of Proposition 4.1.
We continue our study of the construction of analytical coefficients of the epsilon-expansion of hypergeometric functions and their connection with Feynman diagrams. In this paper, we apply the approach of obtaining iteratated solutions to…
Several general properties, concerning reduction algebras - rings of definition and algorithmic efficiency of the set of ordering relations - are discussed. For the reduction algebras, related to the diagonal embedding of the Lie algebra…
We develop a theory of reduction for generalized Kahler and hyper-Kahler structures which uses the generalized Riemannian metric in an essential way, and which is not described with reference solely to a single generalized complex…
We improve several recent results by Hong, Lee, Lee and Park (2012) on gaps and Bzd\c{e}ga (2014) on jumps amongst the coefficients of cyclotomic polynomials. Besides direct improvements, we also introduce several new techniques that have…
Load forecasting is a fundamental task in smart grid. Many techniques have been applied to developing load forecasting models. Due to the challenges such as the Curse of Dimensionality, overfitting, and limited computing resources,…
This paper is a revised version of a previously posted paper in arxiv. The authors posted it as a new submission by mistake. The latest version of the paper can be found at arXiv:math-ph/0512003v2
We propose a variant of elliptic multiple polylogarithms that have at most logarithmic singularities in all variables and satisfy a differential equation without homogeneous term. We investigate several non-trivial elliptic two-loop Feynman…
This paper addresses new results on the factorization of the general Heun's operator, extending the investigations performed in previous works [{\it Applied Mathematics and Computation} {\bf 141} (2003), 177 - 184 and {\bf 189} (2007), 816…
These notes originate from a reading course held by the authors in the spring of 2024 at the Universit\`a di Genova. They provide a hands-on introduction to the F4 and FGLM algorithms. In addition to the notes, we present two…
This manuscript is intended as an accompaniment to Guth's "A restriction estimate using polynomial partitioning". We begin by summarizing the core ideas of the proof, elaborating the history and development of the techniques therein. From…
We introduce a new class of polylogarithm sums closely related to a family studied by L. Vep\v{s}tas in 2010. These generalized sums depend on two free parameters and yield closed-form expressions involving the Dirichlet eta function.…
The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the…
This sequel to Derived Langlands II studies some PSH algebras and their numerical invariants, which generalise the epsilon factors of the local Langlands Programme. It also describes a conjectural Hopf algebra structure on the sum of the…
Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) in finite fields of small characteristic, despite progress having remained essentially static for nearly thirty years, with the best known…