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

We consider the following geometric optimization problem: find a maximum-area rectangle and a maximum-perimeter rectangle contained in a given convex polygon with $n$ vertices. We give exact algorithms that solve these problems in time…

Suppose that $1<p\leq\infty$ and $\varphi\in L^{p}(\mathbb{B}^{n},\mathbb{R}^{n}).$ In this note, we use H\"{o}lder inequality and some basic properties of hypergeometric functions to establish the sharp constant $C_{p}$ and function…

Invariant functions under the transformations of a compact linear group $G$ acting in $\real^n$ can be expressed in terms of functions defined in the orbit space of $G$. We develop a method to determine the isotropy classes of the orbit…

The main result of this paper is a quasi-hamiltonian analogue of a special case of the O'Shea-Sjamaar convexity theorem for usual momentum maps. We denote by U a simply connected compact connected Lie group and we fix an involutive…

In this paper, we introduce the Maximum Matrix Contraction problem, where we aim to contract as much as possible a binary matrix in order to maximize its density. We study the complexity and the polynomial approximability of the problem.…

In the construction of low-rank matrix approximation and maximum element search it is effective to use maxvol algorithm. Nevertheless, even in the case of rank 1 approximation the algorithm does not always converge to the maximum matrix…

We derive a lower and an upper bound for the rank of the finite part of operator $K$-theory groups of maximal and reduced $C^*$-algebras of finitely generated groups. The lower bound is based on the amount of polynomially growing conjugacy…

We discuss the Siciak-Zaharjuta extremal function of pluripotential theory for the unit ball in C^d for spaces of polynomials with the notion of degree determined by a convex body P. We then use it to analyze the approximation properties of…

Recently, there has been increasing interest and progress in improvising the approximation algorithm for well-known NP-Complete problems, particularly the approximation algorithm for the Vertex-Cover problem. Here we have proposed a…

We exhibit a class of "relatively curved" $\vec{\gamma}(t) := (\gamma_1(t),\dots,\gamma_n(t))$, so that the pertaining multi-linear maximal function satisfies the sharp range of H\"{o}lder exponents, \[ \left\| \sup_{r > 0} \ \frac{1}{r}…

We study higher analogues of effective and effectual topological complexity of spaces equipped with a group action. These are $G$-homotopy invariant and are motivated by the (higher) motion planning problem of $G$-spaces for which their…

We study approximation algorithms for several variants of the MaxCover problem, with the focus on algorithms that run in FPT time. In the MaxCover problem we are given a set N of elements, a family S of subsets of N, and an integer K. The…

We consider anti-unification for simply typed lambda terms in associative, commutative, and associative-commutative theories and develop a sound and complete algorithm which takes two lambda terms and computes their generalizations in the…

Consider a polynomial optimization problem. Adding polynomial equations generated by the Fritz John conditions to the constraint set does not change the optimal value. As proved in [arXiv:2205.04254 (2022)], the objective polynomial has…

Let $X=G/H$ be a spherical homogeneous variety for a complex reductive algebraic group $G$. We prove that the orbit space of $X$ under the action of a maximal compact subgroup $K\subset G$ is homeomorphic to the valuation cone of $X$. We…

An action of a group on a vector space partitions the latter into a set of orbits. We consider three natural and useful algorithmic "isomorphism" or "classification" problems, namely, orbit equality, orbit closure intersection, and orbit…

We consider optimal route planning when the objective function is a general nonlinear and non-monotonic function. Such an objective models user behavior more accurately, for example, when a user is risk-averse, or the utility function needs…

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to…

We propose a new formalism to analyse the extremum structure of scale-invariant effective potentials. The problem is stated in a compact matrix form, used to derive general expressions for the stationary point equation and the mass matrix…

We study the computability of the operator norm of a matrix with respect to norms induced by linear operators. Our findings reveal that this problem can be solved exactly in polynomial time in certain situations, and we discuss how it can…