Related papers: Estimating Maximum by Moments for Functions on Orb…

For a geometrically finite group Gamma of G=SO(n,1), we survey recent developments on counting and equidistribution problems for orbits of Gamma in a homogeneous space H\G where H is trivial, symmetric or horospherical. Main applications…

We determine, in an inductive framework, the vertices of the polytope $P(s,K)$ controlling the conjugacy classes of elements which product to one in the maximal compact subgroup $K$ of a simple complex algebraic group $G$. This extends…

In this paper, we study the tradeoff between the approximation guarantee and adaptivity for the problem of maximizing a monotone submodular function subject to a cardinality constraint. The adaptivity of an algorithm is the number of…

We prove almost sharp upper bounds for the $L^p$ norms of eigenfunctions of the full ring of invariant differential operators on a compact locally symmetric space, as well as their restrictions to maximal flat subspaces. Our proof combines…

Let $f,g_1,\dots,g_m$ be polynomials with real coefficients in a vector of variables $x=(x_1,\dots,x_n)$. Denote by $\text{diag}(g)$ the diagonal matrix with coefficients $g=(g_1,\dots,g_m)$ and denote by $\nabla g$ the Jacobian of $g$. Let…

We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest…

Constraint satisfaction problems (CSPs) consist of a set of variables taking values from some finite domain and a set of local constraints on these variables. The objective is to find an assignment to the variables that maximizes the…

The orthogonal group acts on the space of several $n\times n$ matrices by simultaneous conjugation. For an infinite field of characteristic different from two, relations between generators for the algebra of invariants are described. As an…

For a linear group $G$ acting on an absolutely irreducible variety $X$ over the rationals $\QQ$, we describe the orbits of $X(\QQ_p)$ under $G(\QQ_p)$ and of $X(\FF_p((t)))$ under $G(\FF_p((t)))$ for $p$ big enough. This allows us to show…

Let $p$ be a prime and $G$ a subgroup of $GL_d(p)$. We define $G$ to be $p$-exceptional if it has order divisible by $p$, but all its orbits on vectors have size coprime to $p$. We obtain a classification of $p$-exceptional linear groups.…

We describe an approach for finding upper bounds on an ODE dynamical system's maximal Lyapunov exponent among all trajectories in a specified set. A minimization problem is formulated whose infimum is equal to the maximal Lyapunov exponent,…

We investigate the nonlocal energy corresponding to the $p$-oscillation of the unit normal vector for hypersurfaces, or the unit tangent vector for curves. The energy satisfies geometric inequalities with optimal constants $c(n,p)$ and…

For a representation of a finite group $G$ on a complex vector space $V$ we determine when a holomorphic $\binom{p}{q}$-tensor field on the principle stratum of the orbit space $V/G$ can be lifted to a holomorphic $G$-invariant tensor field…

Given a representation of a finite group $G$ over some commutative base ring $\mathbf{k}$, the cofixed space is the largest quotient of the representation on which the group acts trivially. If $G$ acts by $\mathbf{k}$-algebra automorphisms,…

In this paper we introduce an algorithm for determining the orbital elements and individual masses of visual binaries. The algorithm uses an optimal point, which minimizes a specific function describing the average length between the…

We investigate the performance of a deterministic GREEDY algorithm for the problem of maximizing functions under a partition matroid constraint. We consider non-monotone submodular functions and monotone subadditive functions. Even though…

We present a branch and bound method for maximizing an arbitrary set function h mapping 2^V to R. By decomposing h as f-g, where f is a submodular function and g is the cut function of a (simple, undirected) graph G with vertex set V, our…

Consider the following optimization problem: Given $n \times n$ matrices $A$ and $\Lambda$, maximize $\langle A, U\Lambda U^*\rangle$ where $U$ varies over the unitary group $\mathrm{U}(n)$. This problem seeks to approximate $A$ by a matrix…

Constrained submodular set function maximization problems often appear in multi-agent decision-making problems with a discrete feasible set. A prominent example is the problem of multi-agent mobile sensor placement over a discrete domain.…

Given a point $A$ in the convex hull of a given adjoint orbit $\mathcal{O}(F)$ of a compact Lie group $G$, we give a polynomial time algorithm to compute the probability density supported on $\mathcal{O}(F)$ whose expectation is $A$ and…