相关论文: The computation of generalized Ehrhart series in N…

We give a general method for rounding linear programs that combines the commonly used iterated rounding and randomized rounding techniques. In particular, we show that whenever iterated rounding can be applied to a problem with some slack,…

This paper presents a regularized Newton method (RNM) with generalized regularization terms for unconstrained convex optimization problems. The generalized regularization includes quadratic, cubic, and elastic net regularizations as special…

In a previous paper (El. J. Combin. 6 (1999), R37), the author generalized Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational polytope, that is, a polytope with rational vertices, we use its…

We develop an algebraic theory of supports for $R$-linear codes of fixed length, where $R$ is a finite commutative unitary ring. A support naturally induces a notion of generalized weights and allows one to associate a monomial ideal to a…

We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational simplex. Previously such algorithms were known for integer simplices and for rational polytopes of…

This paper studies a suitably normalized set of generalized Hermite polynomials and sets down a relevant Mehler formula, Rodrigues formula, and generalized translation operator. Weighted generalized Hermite polynomials are the…

Computing the probability of a formula given the probabilities or weights associated with other formulas is a natural extension of logical inference to the probabilistic setting. Surprisingly, this problem has received little attention in…

A general method to combine several estimators of the same quantity is investigated. In the spirit of model and forecast averaging, the final estimator is computed as a weighted average of the initial ones, where the weights are constrained…

We describe arithmetic algorithms on a canonical number representation based on the Catalan family of combinatorial objects specified as a Haskell type class. Our algorithms work on a {\em generic} representation that we illustrate on…

We give a proof of the convergence of the BHZ renormalized model associated with the generalized (KPZ) equation that does not require the full strength of the BPHZ renormalisation. Our approach is based on a convenient form of chaos…

A statistical estimation algorithm of the weight distribution of a linear code is shown, based on using its generator matrix as a compression function on random bit strings.

We use the Poincar\'e series method to compute gravity partition functions associated to SU(N) level 1 WZW models with arbitrarily large numbers of modular invariants. The result is an average over these invariants, with the weights being…

We propose an algorithm for evaluation of the cumulative bivariate normal distribution, building upon Marsaglia's ideas for evaluation of the cumulative univariate normal distribution. The algorithm is mathematically transparent, delivers…

We present and discuss an algorithm and its implementation that is capable of directly determining Fourier expansions of any vector-valued modular form of weight at least $2$ associated with representations whose kernel is a congruence…

We study Ehrhart series with coefficients in Abelian group rings. This opens new enumeration applications and unifies earlier variants, in particular, polynomial weighted, $q$-weighted, and equivariant Ehrhart series.

Solving the generalized eigenvalue problem is a useful method for finding energy eigenstates of large quantum systems. It uses projection onto a set of basis states which are typically not orthogonal. One needs to invert a matrix whose…

Various iterative reconstruction algorithms for inverse problems can be unfolded as neural networks. Empirically, this approach has often led to improved results, but theoretical guarantees are still scarce. While some progress on…

This paper studies the estimation of network weights for a class of systems with binary-valued observations. In these systems only quantized observations are available for the network estimation. Furthermore, system states are coupled with…

The recursive method for computing the generalized LM-inverse of a constant rectangular matrix augmented by a column vector is proposed in Udwadia and Phohomsiri (2007) [16] and [17]. The corresponding algorithm for the sequential…

Recent advances in large-margin classification of data residing in general metric spaces (rather than Hilbert spaces) enable classification under various natural metrics, such as string edit and earthmover distance. A general framework…