Related papers: Coefficients of Sylvester's Denumerant
This article establishes the existence of Lyapunov functions for analyzing the stability of a class of state-constrained systems, and it describes algorithms for their numerical computation. The system model consists of a differential…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
We study a mixed-integer set $S:=\{(x,t) \in \{0,1\}^n \times \mathbb{R}: f(x) \ge t\}$ arising in the submodular maximization problem, where $f$ is a submodular function defined over $\{0,1\}^n$. We use intersection cuts to tighten a…
Learning from data in the presence of outliers is a fundamental problem in statistics. Until recently, no computationally efficient algorithms were known to compute the mean of a high dimensional distribution under natural assumptions in…
We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…
In a stochastic probing problem we are given a universe $E$, where each element $e \in E$ is active independently with probability $p_e$, and only a probe of e can tell us whether it is active or not. On this universe we execute a process…
This paper investigates the estimation of the interaction function for a class of McKean-Vlasov stochastic differential equations. The estimation is based on observations of the associated particle system at time $T$, considering the…
The notion of binomial coefficients $T \choose S$ of finite planar, reduced rooted trees $T, S$ is defined and a recursive formula for its computation is shown. The nonassociative binomial formula $$(1 + x)^T = \displaystyle \sum_S {T…
Motivated by recent work of Hanser and Mayers, we study two combinatorial puzzles arising from the theory of Kohnert polynomials. Such polynomials are defined as generating polynomials for certain collections of diagrams consisting of unit…
Assume that the link of a complex normal surface singularity is a rational homology sphere. Then its Seiberg-Witten invariant can be computed as the `periodic constant' of the topological multivariable Poincar\'e series (zeta function).…
In earlier work in collaboration with Pavel Galashin and Thomas McConville we introduced a version of chip-firing for root systems. Our investigation of root system chip-firing led us to define certain polynomials analogous to Ehrhart…
In this paper, we introduce a new approach to constructing unbiased estimators when computing expectations of path functionals associated with stochastic differential equations (SDEs). Our randomization idea is closely related to…
Nous consid\'erons dans cet article des mod\`eles \`a choix binaires et coefficients al\'eatoires. Le but est d'estimer de mani\`ere nonparam\'etrique la densit\'e du coefficient al\'eatoire. Il s'agit d'un probl\`eme inverse mal pos\'e…
A randomized algorithm for a search problem is *pseudodeterministic* if it produces a fixed canonical solution to the search problem with high probability. In their seminal work on the topic, Gat and Goldwasser posed as their main open…
We investigate deep composite polynomial approximations of continuous but non-differentiable functions with algebraic cusp singularities. The functions in focus consist of finitely many cusp terms of the form $|x-a_j|^{\alpha_j}$ with…
We give the first polynomial-time algorithm for robust regression in the list-decodable setting where an adversary can corrupt a greater than $1/2$ fraction of examples. For any $\alpha < 1$, our algorithm takes as input a sample…
An algorithm is proposed, analyzed, and tested experimentally for solving stochastic optimization problems in which the decision variables are constrained to satisfy equations defined by deterministic, smooth, and nonlinear functions. It is…
In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…
A non linear regression approach which consists of a specific regression model incorporating a latent process, allowing various polynomial regression models to be activated preferentially and smoothly, is introduced in this paper. The model…
Given a polynomial $f(x_1,x_2,\ldots, x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $\alpha(n)$ be the number of integers $0\leq a<n$ such that the polynomial congruence $f(x_1, x_2, \ldots, x_t)\equiv a\…