Related papers: Determinantal computation of minimal local GADs
We consider semisimple triangular operators acting in the symmetric component of the group algebra over the weight lattice of a root system. We present a determinantal formula for the eigenbasis of such triangular operators. This…
In this paper we establish a best approximation property of fully discrete Galerkin finite element solutions of second order parabolic problems on convex polygonal and polyhedral domains in the $L^\infty$ norm. The discretization method…
We generalize Gel'fond's criterion of algebraic independence to the context of a sequence of polynomials whose first derivatives take small values on large subsets of a fixed subgroup of the additive group of complex numbers, instead of…
We develop a theoretical foundation for the application of Nesterov's accelerated gradient descent method (AGD) to the approximation of solutions of a wide class of partial differential equations (PDEs). This is achieved by proving the…
We consider determinantal Coulomb gas ensembles with a class of discrete rotational symmetric potentials whose droplets consist of several disconnected components. Under the insertion of a point charge at the origin, we derive the…
We give a construction which produces irreducible complex rigid local systems on $\Bbb{P}_{\Bbb{C}}^1-\{p_1,\dots,p_s\}$ via quantum Schubert calculus and strange duality. These local systems are unitary and arise from a study of vertices…
In this paper, we study local convergence of high-order Tensor Methods for solving convex optimization problems with composite objective. We justify local superlinear convergence under the assumption of uniform convexity of the smooth…
We study efficient solution methods for stochastic eigenvalue problems arising from discretization of self-adjoint partial differential equations with random data. With the stochastic Galerkin approach, the solutions are represented as…
We present a non-standard proof of the fact that the existence of a local (i.e. restricted to a point) characteristic-zero, semi-parametric lifting for a variety defined by the zero locus of polynomial equations over the integers is…
The DEPAS (Decentralized Probabilistic Auto-Scaling) algorithm assumes an overlay network of computing nodes where each node probabilistically decides to shut down, allocate one or more other nodes or do nothing. DEPAS was formulated,…
In this paper, we propose Orthogonal Generative Adversarial Networks (O-GANs). We decompose the network of discriminator orthogonally and add an extra loss into the objective of common GANs, which can enforce discriminator become an…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
The purpose of this paper is to characterize one-dimensional local domains, or more in general reduced, in terms of its Macaulay's inverse system. This leads to study almost finitely generated modules in the divided power ring. We…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
We classify Haag-dual Poincar\'e covariant subsystems $\B\subset \F$ of a graded-local net $\F$ on 4D Minkowski spacetime which satisfies standard assumptions and has trivial superselection structure. The result applies to the canonical…
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…
The paper investigates two invariants for totally disconnected locally compact groups: the number of ends and the rational discrete cohomological dimension. For such a compactly generated group $G$ it is shown that its number of ends can be…
We present a symbolic perturbation scheme for arbitrary polynomial geometric predicates which combines the benefits of Emiris and Canny's simple randomized linear perturbation scheme with Yap's multiple infinitesimal scheme for general…
We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…
This paper continues a research program on constructive investigations of non-commutative Ore localizations, initiated in our previous papers, and particularly touches the constructiveness of arithmetics within such localizations. Earlier…