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

The aim of this paper is to establish various factorization results and then to derive estimates for linear functionals through the use of a generalized Taylor theorem. Additionally, several error bounds are established including…

This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…

Combining the derivative operator with a binomial sum from the telescoping method, we establish a family of summation formulas involving generalized harmonic numbers.

We propose an explicit construction of a weighted generalised Grassmannian. For a weighted Grassmannian (i.e., for series A) we obtain an effective parametrisation of possible $\mathbb{Z}$-gradings on Pl\"{u}cker coordinates, and provide…

We prove normalization for MTT, a general multimodal dependent type theory capable of expressing modal type theories for guarded recursion, internalized parametricity, and various other prototypical modal situations. We prove that deciding…

We give explicit formulas as well as a quadratic time algorithm to solve (so called) generalized Vandermonde's systems of p linear equations and n variables. It allows in particular to find all (so called Lagrange's) interpolation polynoms…

We analyze an algorithm for assigning weights prior to scalarization in discrete multi-objective problems arising from data analysis. The algorithm evolves weights (interpreted as the relevance of features) by a replicator-type dynamic on…

Normal variance mixtures are a class of multivariate distributions that generalize the multivariate normal by randomizing (or mixing) the covariance matrix via multiplication by a non-negative random variable W. The multivariate t…

A general decentralized computational framework for set-valued state estimation and prediction for the class of systems that accept a hybrid state machine representation is considered in this article. The decentralized scheme consists of a…

We rewrite Arthur's asymptotic formula for weighted orbital integrals on real groups with the aid of a residue calculus and extend the resulting formula to the Schwartz space. Then we extract the available information about the coefficients…

Volume computation for $d$-polytopes $\mathcal{P}$ is fundamental in mathematics. There are known volume computation algorithms, mostly based on triangulation or signed-decomposition of $\mathcal{P}$. We consider $…

This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree…

Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…

The generalized number-theoretic transformation (NPT) is formulated on the basis of the exponential function theorem, which allows us to replace operations modulo the expression as a whole by modulo operations on the exponent of this…

A novel recurrence formula for moments with respect to M\"{u}ntz-Legendre polynomials is proposed and applied to construct a numerical method for solving generalized Gauss quadratures with power function weight for M\"{u}ntz systems. These…

A generalization of the classical Lipschitz summation formula is proposed. It involves new polylogarithmic rational functions constructed via the Fourier expansion of certain sequences of Bernoulli--type polynomials. Related families of…

We show that all Eichler integrals, and more generally all "generalized second order modular forms" can be expressed as linear combinations of corresponding generalized second order Eisenstein series with coefficients in classical modular…

Motivated by the learned iterative soft thresholding algorithm (LISTA), we introduce a general class of neural networks suitable for sparse reconstruction from few linear measurements. By allowing a wide range of degrees of weight-sharing…

We generalize the Brouwer-Zimmermann algorithm, which is the most efficient general algorithm for computing the minimum distance of a random linear code, to the case of generalized Hamming weights. We also adapt this algorithm to compute…

We compute explicitly the equivariant Hirzebruch $\chi_y$-characteristic of an equivariant complex line bundle over a toric manifold and state a weighted version of the quantization commutes with reduction principle in symplectic geometry.…