Related papers: A review of Dan's reduction method for multiple po…
We propose a modularization method that decomposes a deep neural network (DNN) into small modules from a functionality perspective and recomposes them into a new model for some other task. Decomposed modules are expected to have the…
This paper is our third step towards developing a theory of testing monomials in multivariate polynomials and concentrates on two problems: (1) How to compute the coefficients of multilinear monomials; and (2) how to find a maximum…
We give a simple proof of the Beurling-Malliavin multiplier theorem (BM1) in the particular case of weights that verify the usual finite logarithmic integral condition and such that their log are H{\"o}lder continuous with exponent less…
For the algebra $I_n$ of polynomial integro-differential operators over a field $K$ of characteristic zero, a classification of simple weight and generalized weight (left and right) $I_n$-modules is given. It is proven that the category of…
System I is a simply-typed lambda calculus with pairs, extended with an equational theory obtained from considering the type isomorphisms as equalities. In this work we propose an extension of System I to polymorphic types, adding the…
A new proof is given for the correctness of the powers of two descent method for computing discrete logarithms. The result is slightly stronger than the original work, but more importantly we provide a unified geometric argument,…
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…
Some time ago the first author suggested two different constructions of Grassmannian n-logarithms. One of them works for all n, but its motivic nature is hidden. The other is a motivic but so far available only for n=2,3,4. We derived some…
We present a coalgebraic framework for studying generalisations of dynamic modal logics such as PDL and game logic in which both the propositions and the semantic structures can take values in an algebra $\mathbf{A}$ of truth-degrees. More…
Strong algebraic proof systems such as IPS (Ideal Proof System; Grochow-Pitassi [GP18]) offer a general model for deriving polynomials in an ideal and refuting unsatisfiable propositional formulas, subsuming most standard propositional…
For any positive integer $N$ let $\mu_N$ be the group of the $N$th roots of unity. In this note we shall study the $\Q$-linear relations among values of multiple polylogarithms evaluated at $\mmu_N$. We show that the standard relations…
The class of input-output systems representable as Chen-Fliess series arises often in control theory. One well known drawback of this representation, however, is that the iterated integrals which appear in these series are algebraically…
Given a simple Lie algebra $\mathfrak{g}$, Kostant's weight $q$-multiplicity formula is an alternating sum over the Weyl group whose terms involve the $q$-analog of Kostant's partition function. For $\xi$ (a weight of $\mathfrak{g}$), the…
We prove some new evaluations for multiple polylogarithms of arbitrary depth. The simplest of our results is a multiple zeta evaluation one order of complexity beyond the well-known Broadhurst-Zagier formula. Other results we provide settle…
In order to have a multiresolution analysis, the scaling function must be refinable. That is, it must be the linear combination of 2-dilation, $\mathbb{Z}$-translates of itself. Refinable functions used in connection with wavelets are…
In this talk, we discuss recent progress in the application of generalizations of polylogarithms in the symbolic computation of multi-loop integrals. We briefly review the Maple program MPL which supports a certain approach for the…
We present single imputation method for missing values which borrows the idea of data depth---a measure of centrality defined for an arbitrary point of a space with respect to a probability distribution or data cloud. This consists in…
The general structure of infrared divergences in the scattering of massive particles is captured by the soft anomalous dimension matrix. The latter can be computed from a correlation function of multiple Wilson lines. The state-of-the-art…
For a composition $I$ whose first part exceeds 1, we can define the multiple $t$-value $t(I)$ as the sum of all the terms in the series for the multiple zeta value $\zeta(I)$ whose denominators are odd. In this paper we show that if $I$ is…
We propose a methodology for computing single and multi-asset European option prices, and more generally expectations of scalar functions of (multivariate) random variables. This new approach combines the ability of Monte Carlo simulation…