搜索结果: 1-15 共查到“几何学 Convex”相关记录22条 . 查询时间(0.109 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：The logarithmic Brunn-Minkowski inequality conjecture in convex geometry
凸几何 对数 布伦-闵可夫斯基 不等式猜想
font style='font-size:12px;'>
2023/4/21
The logarithmic Brunn-Minkowski inequality conjecture is one of the most intriguing challenges in convex geometry since 2012. Notably, this conjectured inequality is stronger than the celebrated Brunn...
Scalable Frames and Convex Geometry
Scalable frames tight frames preconditioning Farkas’s lemma
font style='font-size:12px;'>
2015/12/10
The recently introduced and characterized scalable frames can be considered as those frames which allow for perfect preconditioning in the sense that the frame vectors can be rescaled to yield a tight...
CONVEX REAL PROJECTIVE STRUCTURES ON CLOSED SURFACES ARE CLOSED
REAL PROJECTIVE STRUCTURES CLOSED SURFACES
font style='font-size:12px;'>
2015/9/29
T. The deformation space t(E) of convex Rp2_ structures on a closed
surface Y with X(z) < 0 is closed in the space Hom(7r, SL(3, IR))/SL(3, IR)
of equivalence classes of representations r1 (l) -- ...
Convex optimization of output link scheduling and active queue management in QoS constrained packet switches
Algorithm switches generalized geometric programming convex optimization
font style='font-size:12px;'>
2015/8/11
We present two novel algorithms at the ingress and egress of packet switches with QoS provisioning and fairness constraints. We first provide a suite of generalized weighted fair queuing formulations ...
Exact Matrix Completion via Convex Optimization
Matrix completion low-rank matrices convex optimization duality in optimization nuclear norm minimization random matrices noncommutative Khintchine inequality decoupling compressed sensing
font style='font-size:12px;'>
2015/6/17
We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. ...
The Power of Convex Relaxation:Near-Optimal Matrix Completion
Matrix completion low-rank matrices semidefinite programming duality in optimization nuclear norm minimization random matrices and techniques from random matrix theory free probability
font style='font-size:12px;'>
2015/6/17
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a great number of applica...
Finding the Maximum Area Parallelogram in a Convex Polygon
Maximum Area Parallelogram Convex Polygon
font style='font-size:12px;'>
2012/12/3
We consider the problem of finding the maximum area parallelogram (MAP) inside a given convex polygon. Our main result is an algorithm for computing the MAP
in an n-sided polygon in O(n2) time. Achie...
Change of Topology in Mean Convex Mean Curvature Flow
Change of Topology Mean Convex Mean Curvature Flow Differential Geometry
font style='font-size:12px;'>
2011/9/19
Abstract: Consider the mean curvature flow of an (n+1)-dimensional, compact, mean convex region in Euclidean space (or, if n<7, in a Riemannian manifold). We prove that elements of the m-th homotopy g...
The Log-Convex Density Conjecture and vertical surface area in warped products
The Log-Convex Density Conjecture vertical surface area warped products Differential Geometry
font style='font-size:12px;'>
2011/9/19
Abstract: We examine the vertical component of surface area in the warped product of a Euclidean interval and a fiber manifold with product density. We determine general conditions under which vertica...
On Arnold's Problem on the Classifications of Convex Lattice Polytopes
Arnold's Problem Classifications of Convex Lattice Polytopes Metric Geometry
font style='font-size:12px;'>
2011/9/9
Abstract: In 1980, V.I. Arnold studied the classification problem for convex lattice polygons of given area. Since then this problem and its analogues have been studied by B'ar'any, Pach, Vershik, Liu...
Equidistribution of Eisenstein series on convex co-compact hyperbolic manifolds
Equidistribution of Eisenstein series convex co-compact hyperbolic manifolds Spectral Theory
font style='font-size:12px;'>
2011/9/5
Abstract: For convex co-compact hyperbolic manifolds $\Gamma\backslash \mathbb{H}^{n+1}$ for which the dimension of the limit set satisfies $\delta_\Gamma< n/2$, we show that the high-frequency Eisens...
On affine maps on non-compact convex sets and some characterizations of finite-dimensional solid ellipsoids
affine maps non-compact convex sets characterizations of finite-dimensional solid ellipsoids
font style='font-size:12px;'>
2011/2/25
In recent studies, properties of the set of affine maps between two convex sets have been
investigated with intensive motivation from quantum physics, but in those preceding works
the underlying con...
The number of convex pentagons and hexagons in an $n$-triangular net
n-triangular net convex pentagon convex hexagon regular hexagon
font style='font-size:12px;'>
2011/2/22
In this paper, we obtain the counting formulaes of convex pentagons and convex hexagons, respectively, in an n-triangular net by solving the corresponding recursive formulaes.
Triangulations of nearly convex polygons
triangulation convex set triangulation polynomial
font style='font-size:12px;'>
2011/1/20
Counting Euclidean triangulations with vertices in a finite set C of the convex hull Conv(C ) of C is difficult in general, both algorithmically and theoretically. The aim of this paper
is to describ...
Centro-Affine Invariants for Smooth Convex Bodies
Centro-Affine Invariants Smooth Convex Bodies
font style='font-size:12px;'>
2010/11/24
Employing a centro-affine flow on smooth convex bodies, we generate new centro-affine differential invariants. One class of the newly defined invariants is the object of a sharp isoperimetric inequali...