Related papers: Computing the First Betti Numberand Describing the…
We study the equality of the extremal Betti numbers of the binomial edge ideal $J_G$ and those of its initial ideal ${\rm in}(J_G)$ of a closed graph $G$. We prove that in some cases there is an unique extremal Betti number for ${\rm…
One familiar with the Euler zeta function, which established the remarkable relationship between the prime and composite numbers, might naturally ponder the results of the application of this special function in cases where there is no…
In a recent paper the first two authors proved that the generating series of the Poincare polynomials of the quasihomogeneous Hilbert schemes of points in the plane has a simple decomposition in an infinite product. In this paper we give a…
We give a numerical characterization of the possible extremal Betti numbers (values as well as positions) of any homogeneous ideal in a polynomial ring over a field.
We analyze the bit complexity of an algorithm for the computation of at least one point in each connected component of a smooth real algebraic set. This work is a continuation of our analysis of the hypersurface case (On the bit complexity…
This talk describes how a combination of symbolic computation techniques with first-order theorem proving can be used for solving some challenges of automating program analysis, in particular for generating and proving properties about the…
We determine the Betti numbers of the Springer fibers in type A. To do this, we construct a cell decomposition of the Springer fibers. The codimension of the cells is given by an analogue of the Coxeter length. This makes our cell…
We introduce general tools for designing efficient private estimation algorithms, in the high-dimensional settings, whose statistical guarantees almost match those of the best known non-private algorithms. To illustrate our techniques, we…
The powers of matrices with Stirling number-coefficients are investigated. It is revealed that the elements of these matrices have a number of properties of the ordinary Stirling numbers. Moreover, "higher order" Bell, Fubini and Eulerian…
This paper investigates a numerical probabilistic method for the solution of some semilinear stochastic partial differential equations (SPDEs in short). The numerical scheme is based on discrete time approximation for solutions of systems…
We describe a nearly-linear time algorithm to solve the linear system $L_1x = b$ parameterized by the first Betti number of the complex, where $L_1$ is the 1-Laplacian of a simplicial complex $K$ that is a subcomplex of a collapsible…
We study some essential arithmetic properties of a new tree-based number representation, {\em hereditarily binary numbers}, defined by applying recursively run-length encoding of bijective base-2 digits. Our representation expresses giant…
We consider methods for finding high-precision approximations to simple zeros of smooth functions. As an application, we give fast methods for evaluating the elementary functions log(x), exp(x), sin(x) etc. to high precision. For example,…
The prime-counting function $\pi(x)$ which computes the number of primes smaller or equal to a given real number has a long-standing interest in number theory. The present manuscript proposes a method to compute $\pi(x)$ with time…
A novel boundary element method (BEM) removes the classical dependence on explicit fundamental solutions and extends quasi-optimal BEM discretisations to strongly elliptic operators with variable coefficients. The approach constructs a…
We present a procedure to enumerate the whole set of numerical semigroups with a given Frobenius number F, S(F). The methodology is based on the construction of a partition of S(F) by a congruence relation. We identify exactly one…
This paper presents a new approach to evaluating the special values of the Dirichlet beta function, $\beta(2k+1)$, where $k$ is any nonnegative integer. Our approach relies on some properties of the Euler numbers and polynomials, and uses…
There have been several recent articles studying homology of various types of random simplicial complexes. Several theorems have concerned thresholds for vanishing of homology, and in some cases expectations of the Betti numbers. However…
We present the concept of the \emph{information efficiency of functions} as a technique to understand the interaction between information and computation. Based on these results we identify a new class of objects that we call…
Algorithms for numerical computation of symmetric elliptic integrals of all three kinds are improved in several ways and extended to complex values of the variables (with some restrictions in the case of the integral of the third kind).…