Related papers: Solving the likelihood equations to compute Euler …
The cohomology ring of a finite group, with coefficients in a finite field, can be computed by a machine, as Carlson has showed. Here "compute" means to find a presentation in terms of generators and relations, and involves only the…
Ou et al. (2022) introduce the problem of learning set functions from data generated by a so-called optimal subset oracle. Their approach approximates the underlying utility function with an energy-based model, whose parameters are…
Under certain conditions, we give an estimate from above on the number of differential equations of order $r+1$ with prescribed regular singular points, prescribed exponents at singular points, and having a quasi-polynomial flag of…
We study several variants of Euler sums by using the methods of contour integration and residue theorem. These variants exhibit nice properties such as closed forms, reduction, etc., like classical Euler sums. In addition, we also define a…
For an affine complex algebraic singular space Y, we define a global Euler obstruction Eu(Y) which extends the Euler-Poincare characteristic of a nonsingular Y. Using Lefschetz pencils, we express Eu(Y) as alternating sum of global polar…
In the final paper of the Graph Minors series N. Robertson and P. Seymour proved that graphs are well-quasi-ordered under the immersion ordering. A direct implication of this theorem is that each class of graphs that is closed under taking…
Maximum likelihood estimation is a fundamental computational problem in statistics. In this note, we give a bound for the maximum likelihood degree of algebraic statistical models for discrete data. As usual, such models are identified with…
Given a finite CW complex $K$, we use a version of the Goodwillie-Weiss tower to formulate an obstruction theory for embedding $K$ into a Euclidean space $\mathbb{R}^d$. For $2$-dimensional complexes in $\mathbb{R}^4$, a geometric analogue…
The expectation-maximization (EM) algorithm is a powerful computational technique for finding the maximum likelihood estimates for parametric models when the data are not fully observed. The EM is best suited for situations where the…
We propose a new algorithm for computing validated bounds for the solutions to the first order variational equations associated to ODEs. These validated solutions are the kernel of numerics computer-assisted proofs in dynamical systems…
For a complex variety with a torus action we propose a new method of computing Chern-Schwartz-MacPherson classes. The method does not apply resolution of singularities. It is based on Localization Theorem in equivariant cohomology.
Roughly speaking, to any space $M$ with perfect obstruction theory we associate a space $N$ with symmetric perfect obstruction theory. It is a cone over $M$ given by the dual of the obstruction sheaf of $M$, and contains $M$ as its zero…
The aim of the paper is to relate computational and arithmetic questions about Euler's constant $\gamma$ with properties of the values of the $q$-logarithm function, with natural choice of $q$. By these means, we generalize a classical…
We describe a new algorithm for computing Whitney stratifications of complex projective varieties. The main ingredients are (a) an algebraic criterion, due to L\^e and Teissier, which reformulates Whitney regularity in terms of conormal…
It is known that Euler numbers, defined as the Taylor coefficients of the tangent and secant functions, count alternating permutations in the symmetric group. Springer defined a generalization of these numbers for each finite Coxeter group…
We prove several new variants of the Lambert series factorization theorem established in the first article "Generating special arithmetic functions by Lambert series factorizations" by Merca and Schmidt (2017). Several characteristic…
The expectation-maximization (EM) algorithm introduced by Dempster et al in 1977 is a very general method to solve maximum likelihood estimation problems. In this informal report, we review the theory behind EM as well as a number of EM…
We analyze the complexity of fitting a variety, coming from a class of varieties, to a configuration of points in $\Bbb C^n$. The complexity measure, called the algebraic complexity, computes the Euclidean Distance Degree (EDdegree) of a…
We study the Euler obstruction of essentially isolated determinantal singularities (EIDS). The EIDS were defined by W. Ebeling and S. Gusein-Zade, as a generalization of isolated singularity. We obtain some formulas to calculate the Euler…
We introduce and prove several new formulas for the Euler-Mascheroni Constant. This is done through the introduction of the defined E-Harmonic function, whose properties, in this paper, lead to two novel formulas, alongside a family of…