相关论文: Generalizing The Davenport-Mahler-Mignotte Bound -…

Let $p(x)$ be an integer polynomial with $m\ge 2$ distinct roots $\rho_1,\ldots,\rho_m$ whose multiplicities are $\boldsymbol{\mu}=(\mu_1,\ldots,\mu_m)$. We define the D-plus discriminant of $p(x)$ to be $D^+(p):= \prod_{1\le i<j\le…

Dantzig-Wolfe decomposition (DWD) is a classical algorithm for solving large-scale linear programs whose constraint matrix involves a set of independent blocks coupled with a set of linking rows. The algorithm decomposes such a model into a…

We introduce a new approach to isolate the real roots of a square-free polynomial $F=\sum_{i=0}^n A_i x^i$ with real coefficients. It is assumed that each coefficient of $F$ can be approximated to any specified error bound. The presented…

Let $A$ be a finite-dimensional, commutative algebra over $\mathbb{R}$ or $\mathbb{C}$. The notion of $A$-differentiable functions on $A$ is extended to the notion of $A$-differentiable functions on a finitely generated $A$-module $B$. Let…

Let $\mathfrak{g}$ be a finite or an affine type Lie algebra over $\mathbb{C}$ with root system $\Delta$. We show a parabolic generalization of the partial sum property for $\Delta$, which we term the parabolic partial sum property. It…

Edge-weighted graphs play an important role in the theory of Robinsonian matrices and similarity theory, particularly via the concept of level graphs, that is, graphs obtained from an edge-weighted graph by removing all sufficiently light…

In this paper, we consider the relationship between the Mahler measure of a polynomial and its separation. In 1964, Mahler proved that if $f(x) \in \mathbb{Z}[x]$ is separable of degree $n$, then $\operatorname{sep}(f) \gg_n M(f)^{-(n-1)}$.…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a real coefficient polynomial. They can be approximated at a low computational cost if the…

Several algorithms involving the Variational R\'enyi (VR) bound have been proposed to minimize an alpha-divergence between a target posterior distribution and a variational distribution. Despite promising empirical results, those algorithms…

We initiate a study of Hilbert modules over the polynomial algebra A=C[z_1,...,z_d] that are obtained by completing A with respect to an inner product having certain natural properties. A standard Hilbert module is a finite multiplicity…

A matching cut is a partition of the vertex set of a graph into two sets $A$ and $B$ such that each vertex has at most one neighbor in the other side of the cut. The MATCHING CUT problem asks whether a graph has a matching cut, and has been…

For linear classifiers, the relationship between (normalized) output margin and generalization is captured in a clear and simple bound -- a large output margin implies good generalization. Unfortunately, for deep models, this relationship…

In recent years, neural networks have achieved remarkable progress in various fields and have also drawn much attention in applying them on scientific problems. A line of methods involving neural networks for solving partial differential…

In $d$-Scattered Set we are given an (edge-weighted) graph and are asked to select at least $k$ vertices, so that the distance between any pair is at least $d$, thus generalizing Independent Set. We provide upper and lower bounds on the…

In this paper, we present generalization bounds for the unsupervised risk in the Deep Contrastive Representation Learning framework, which employs deep neural networks as representation functions. We approach this problem from two angles.…

Multivariate multiplicity codes (Kopparty, Saraf, and Yekhanin, J. ACM 2014) are linear codes where the codewords are described by evaluations of multivariate polynomials (with a degree bound) and their derivatives up to a fixed order, on a…

Rigid graph theory is an active area with many open problems, especially regarding embeddings in $\mathbb{R}^d$ or other manifolds, and tight upper bounds on their number for a given number of vertices. Our premise is to relate the number…

Breaking symmetries is a popular way of speeding up the branch-and-bound method for symmetric integer programs. We study fundamental domains, which are minimal and closed symmetry breaking polyhedra. Our long-term goal is to understand the…

One of the key results in Robertson and Seymour's seminal work on graph minors is the Grid-Minor Theorem (also called the Excluded Grid Theorem). The theorem states that for every grid $H$, every graph whose treewidth is large enough…

The approximation of a multiple isolated root is a difficult problem. In fact the root can even be a repulsive root for a fixed point method like the Newton method. However there exists a huge literature on this topic but the answers given…