Related papers: The computation of generalized Ehrhart series in N…
Probabilistic graphical models are a key tool in machine learning applications. Computing the partition function, i.e., normalizing constant, is a fundamental task of statistical inference but it is generally computationally intractable,…
Generalizing polynomials previously studied in the context of linear codes, we define weight polynomials and an enumerator for a matroid $M$. Our main result is that these polynomials are determined by Betti numbers associated with graded…
In this paper we obtain a weighted average formula for special values of $L$-functions attached to normalized elliptic modular forms of weight $k$ and full level. These results are obtained by studying the pullback of a Siegel Eisenstein…
Generalized inverses of tensors play increasingly important roles in computational mathematics and numerical analysis. It is appropriate to develop the theory of generalized inverses of tensors within the algebraic structure of a ring. In…
This paper presents a generalization of the random dot product model for networks whose edge weights are drawn from a parametrized probability distribution. We focus on the case of integer weight edges and show that many previously studied…
We continue our recent work on additive problems with prime summands: we already studied the \emph{average} number of representations of an integer as a sum of two primes, and also considered individual integers. Furthermore, we dealt with…
In this paper, we mainly show that Euler sums of generalized hyperharmonic numbers can be expressed in terms of linear combinations of the classical Euler sums.
We study the problem of coalitional manipulation---where $k$ manipulators try to manipulate an election on $m$ candidates---under general scoring rules, with a focus on the Borda protocol. We do so both in the weighted and unweighted…
In this work we propose a combinatorial model that generalizes the standard definition of permutation. Our model generalizes the degenerate Eulerian polynomials and numbers of Carlitz from 1979 and provides missing combinatorial proofs for…
Despite the advances in the development of numerical methods analytical approaches still play the key role on the way towards a deeper understanding of many-particle systems. In this regards, diagonalization schemes for Hamiltonians…
For solving linear ill-posed problems regularization methods are required when the right hand side is with some noise. In the present paper regularized solutions are obtained by implicit iteration methods in Hilbert scales. % By exploiting…
Generalized trigonometric functions are applied to the Legendre-Jacobi standard form of complete elliptic integrals, and a new form of the generalized complete elliptic integrals of the Borweins is presented. According to the form, it can…
The Bernstein-B\'ezier form of a polynomial is widely used in the fields of computer aided geometric design, spline approximation theory and, more recently, for high order finite element methods for the solution of partial differential…
The Randomized Kaczmarz Algorithm is a randomized method which aims at solving a consistent system of over determined linear equations. This note discusses how to find an optimized randomization scheme for this algorithm, which is related…
We develop a novel, fundamental and surprisingly simple randomized iterative method for solving consistent linear systems. Our method has six different but equivalent interpretations: sketch-and-project, constrain-and-approximate, random…
The purpose of this article is to compute the normal form of a class of general quadratic Hamiltonian systems that generalizes naturally Euler's equations from the free rigid body dynamics.
In this paper, we discuss the generalized Hamming weights of a class of linear codes associated with non-degenerate quadratic forms. In order to do so, we study the quadratic forms over subspaces of finite field and obtain some interesting…
We propose and analyze a regularization approach for structured prediction problems. We characterize a large class of loss functions that allows to naturally embed structured outputs in a linear space. We exploit this fact to design…
Entanglement forging based variational algorithms leverage the bi-partition of quantum systems for addressing ground state problems. The primary limitation of these approaches lies in the exponential summation required over the numerous…
We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…