Related papers: A review of Dan's reduction method for multiple po…
We propose and study a generalization to the well-known problem of polyline simplification. Instead of a single polyline, we are given a set of $\ell$ polylines possibly sharing some line segments and bend points. Our goal is to minimize…
This paper explores the extension of dimension reduction (DR) techniques to the multi-dimension case by using the Einstein product. Our focus lies on graph-based methods, encompassing both linear and nonlinear approaches, within both…
Recently in arXiv:2012.05599 Rudenko presented a formula for the volume of hyperbolic orthoschemes in terms of alternating polylogarithms. We use this result to provide an explicit analytic result for the one-loop scalar n-gon Feynman…
We investigate the relation between $\delta$ and $\epsilon$ required for obtaining a $(1+\delta)$-approximation in time $N^{2-\epsilon}$ for closest pair problems under various distance metrics, and for other related problems in…
Submodular function minimization is a key problem in a wide variety of applications in machine learning, economics, game theory, computer vision, and many others. The general solver has a complexity of $O(n^3 \log^2 n . E +n^4 {\log}^{O(1)}…
Despite their tremendous success and versatility, Deep Neural Networks (DNNs) such as Large Language Models (LLMs) suffer from inference inefficiency and rely on advanced computational infrastructure. To address these challenges and make…
This paper is based on the observation that dimension of weight spaces of multi-variable Weyl modules depends polynomially on the highest weight (Conjecture 1). We support this conjecture by various explicit answers for up to three variable…
We consider reduction of dimension for nonlinear dynamical systems. We demonstrate that in some cases, one can reduce a nonlinear system of equations into a single equation for one of the state variables, and this can be useful for…
For an integer n>2 we define a polylogarithm, which is a holomorphic function on the universal abelian cover of C-{0,1} defined modulo (2 pi i)^n/(n-1)!. We use the formal properties of its functional relations to define groups lifting…
Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…
We introduce a new definition of a generalized logarithmic module of multiarrangements by uniting those of the logarithmic derivation and the differential modules. This module is realized as a logarithmic derivation module of an arrangement…
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polynomials have small degree. Their idea is to use Karatsuba's…
It is shown that the methods and algorithms, developed in (A. Capani et al., Computing minimal finite free resolutions, {\it Journal of Pure and Applied Algebra}, (117& 118)(1997), 105 -- 117; M. Kreuzer and L. Robbiano, {\it Computational…
We present algorithms to factorize weighted homogeneous elements in the first polynomial Weyl algebra and $q$-Weyl algebra, which are both viewed as a $\mathbb{Z}$-graded rings. We show, that factorization of homogeneous polynomials can be…
We consider the vector-valued Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}^n$ that outputs all $n$ monomials of degree $n-1$, i.e., $f_i(x)=\bigwedge_{j\neq i}x_j$, for $n\geq 3$. Boyar and Find have shown that the multiplicative…
In this paper we show that the iterated integrals on products of one variable multiple polylogarithms from 0 to 1 are actually multiple zeta values if they are convergent. In the divergent case, we define regularized iterated integrals from…
We demonstrate that a modification of the classical index calculus algorithm can be used to factor integers. More generally, we reduce the factoring problem to finding an overdetermined system of multiplicative relations in any factor base…
We introduce an efficient and scalable method for density-based multi-material topology optimization, integrating classical mirror descent techniques with point-wise polytopal design constraints. Such constraints arise naturally in this…
We introduce a new Lie-algebraic approach to explicitly construct the motivic coaction and single-valued map of multiple polylogarithms in any number of variables. In both cases, the appearance of multiple zeta values is controlled by…
New soft- and hard decision decoding algorithms are presented for general Reed-Muller codes $\left\{\genfrac{}{}{0pt}{}{m}{r}\right\} $ of length $2^{m}$ and distance $2^{m-r}$. We use Plotkin $(u,u+v)$ construction and decompose code…