相关论文: Estimating Maximum by Moments for Functions on Orb…

In this paper, we compute the tightest possible bounds on the probability that the optimal value of a combinatorial optimization problem in maximization form with a random objective exceeds a given number, assuming only knowledge of the…

In many physical problems or applications one has to study functions that are invariant under the action of a symmetry group G and this is best done in the orbit space of G if one knows the equations and inequalities defining the orbit…

We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem…

Properties of a given symmetry group G are very important in investigation of a physical system invariant under its action. In the case of finite spin systems (magnetic rings, some planar macromolecules) the symmetry group is isomorphic…

Let $G$ be a finitely generated solvable-by-finite linear group. We present an algorithm to compute the torsion-free rank of $G$ and a bound on the Pr\"{u}fer rank of $G$. This yields in turn an algorithm to decide whether a finitely…

We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…

In this paper we address the numerical approximation of linear fourth-order elliptic problems on polygonal meshes. In particular, we present a novel nonconforming virtual element discretization of arbitrary order of accuracy for biharmonic…

We present a method for estimating the maximal symmetry of a continuous regression function. Knowledge of such a symmetry can be used to significantly improve modelling by removing the modes of variation resulting from the symmetries.…

When a group acts on a set, it naturally partitions it into orbits, giving rise to orbit problems. These are natural algorithmic problems, as symmetries are central in numerous questions and structures in physics, mathematics, computer…

Complex polynomial optimization has recently gained more and more attention in both theory and practice. In this paper, we study the optimization of a real-valued general conjugate complex form over various popular constraint sets including…

We study the maximal rank in affine subspaces of symmetric or alternating matrices, in terms of the matching numbers of certain associated graphs. Applications include simple proofs of upper bounds on the dimension of such subspaces in…

In the total matching problem, one is given a graph $G$ with weights on the vertices and edges. The goal is to find a maximum weight set of vertices and edges that is the non-incident union of a stable set and a matching. We consider the…

We discuss the L^p-boundedness of maximal singular integrals in the plane over a finite set V of N directions. Logarithmic bounds are established for a set V of arbitrary structure in the 2<=p<infinity range. Sharp bounds are proved for…

This is a survey on best polynomial approximation on the unit sphere and the unit ball. The central problem is to describe the approximation behavior of a function by polynomials via smoothness of the function. A major effort is to identify…

We calculate the p-the moment of the sum of n independent random variables with respect to symmetric norm in R^n. The order of growth for upper bound p/ln p obtained in ths estimate is optimal. The result extends to generalized Lorentz…

Let G denote a closed, connected, self adjoint, noncompact subgroup of GL(n,R), and let d_{R} denote the canonical right invariant Riemannian metric on G. For v in R^{n} let G_{v} = {g in G : g(v) = v}. We obtain algebraically defined upper…

Spectral approximation by polynomials on the unit ball is studied in the frame of the Sobolev spaces $W^{s}_p(\ball)$, $1<p<\infty$. The main results give sharp estimates on the order of approximation by polynomials in the Sobolev spaces…

Maximum bipartite matching is a fundamental algorithmic problem which can be solved in polynomial time. We consider a natural variant in which there is a separation constraint: the vertices on one side lie on a path or a grid, and two…

The maximum (or minimum) generalized eigenvalue of symmetric positive semidefinite matrices that depend on optimization variables often appears as objective or constraint functions in structural topology optimization when we consider…

Orbit harmonics is a tool in combinatorial representation theory which promotes the (ungraded) action of a linear group $G$ on a finite set $X$ to a graded action of $G$ on a polynomial ring quotient by viewing $X$ as a $G$-stable point…