中文
相关论文

相关论文: On the circumradius of a special class of n-simpli…

200 篇论文

K. Bezdek and Gy. Kiss showed that existence of origin-symmetric coverings of unit sphere in $\mathbb{E}^n$ by at most $2^n$ congruent spherical caps with radius not exceeding $\arccos\sqrt{\frac{n-1}{2n}}$ implies the $X$-ray conjecture…

度量几何 · 数学 2025-04-15 A. Bondarenko , A. Prymak , D. Radchenko

In this paper we consider an inverse problem of determining a minimal surface embedded in a Riemannian manifold. We show under a topological condition that if $\Sigma$ is a $2$-dimensional embedded minimal surface, then the knowledge of the…

偏微分方程分析 · 数学 2023-10-24 Cătălin I. Cârstea , Matti Lassas , Tony Liimatainen , Leo Tzou

We consider the hypergraph Tur\'an problem of determining $\mathrm{ex}(n, S^d)$, the maximum number of facets in a $d$-dimensional simplicial complex on $n$ vertices that does not contain a simplicial $d$-sphere (a homeomorph of $S^d$) as a…

组合数学 · 数学 2026-01-14 Andrew Newman , Marta Pavelka

It is known that in $\mathbb{R}^n,n\geq 2$, a compact set which contains $n-1$ spheres with all radii in $[1/2,1]$ or with all possible centres in $[0,1]^n$ has full Hausdorff dimension. In fact the later set has positive Lebesgue measure.…

经典分析与常微分方程 · 数学 2018-01-09 Han Yu

We prove the scalar curvature rigidity for $L^\infty$ metrics on $\mathbb S^n\backslash\Sigma$, where $\mathbb S^n$ is the $n$-dimensional sphere with $n\geq 3$ and $\Sigma$ is a closed subset of $\mathbb S^n$ of codimension at least…

微分几何 · 数学 2026-05-21 Jinmin Wang , Zhizhang Xie

In this note we show the n-2-dimensional volumes of codimension 2 faces of an n-dimensional simplex are algebraically independent functions of the lengths of edges. In order to prove this we compute the complete spectrum of a…

度量几何 · 数学 2008-03-11 Igor Rivin

An Any graph obtained by deleting a Hamming code of length n from a n-cube Qn is called as a Hamming shell. It is well known that a Hamming shell is vertex-transitive, edge-transitive, distance preserving. Moreover, it is Hamiltonian and…

组合数学 · 数学 2018-05-01 S. A. Mane , B. N. Waphare

A pancyclic graph is a simple graph containing a cycle of length $k$ for all $3\leq k\leq n$. Let $m(n)$ be the minimum number of edges of all pancyclic graphs on $n$ vertices. Exact values are given for $m(n)$ for $n\leq 37$, combining…

组合数学 · 数学 2013-12-03 Sean Griffin

Let D be a strongly connected digraph and A(D) be the adjacency matrix of D. Let diag(D) be the diagonal matrix with outdegrees of the vertices of D and Q(D) = diag(D) + A(D) be the signless Laplacian matrix of D. The spectral radius of…

组合数学 · 数学 2014-01-29 Wenxi Hong , Lihua You

We give a sharp lower bound on the area of the domain enclosed by an embedded curve lying on a two-dimensional sphere, provided that geodesic curvature of this curve is bounded from below. Furthermore, we prove some dual inequalities for…

微分几何 · 数学 2016-05-31 Alexander Borisenko , Kostiantyn Drach

A ringoid is a set with two binary operations that are linked by the distributive laws. We study special classes of ringoids that are congruence-simple or ideal-simple. In particular, we examine generalised parasemifields and…

环与代数 · 数学 2009-10-27 Jens Zumbrägel

A spectrahedron is a set defined by a linear matrix inequality. Given a spectrahedron we are interested in the question of the smallest possible size $r$ of the matrices in the description by linear matrix inequalities. We show that for the…

代数几何 · 数学 2016-06-30 Mario Kummer

First, we fill in key gaps in Steiner's nice characterization of the most nearly circular ellipse which passes through the vertices of a convex quadrilateral, D. Steiner proved that there is only one pair of conjugate directions, M1 and M2,…

经典分析与常微分方程 · 数学 2011-07-29 Alan Horwitz

The standard simplex in R^n, also known as the probability simplex, is the set of nonnegative vectors whose entries sum up to 1. They frequently appear as constraints in optimization problems that arise in machine learning, statistics, data…

最优化与控制 · 数学 2022-08-31 Qiuwei Li , Daniel McKenzie , Wotao Yin

We investigate the symmetric inverse M-matrix problem from a geometric perspective. The central question in this geometric context is, which conditions on the k-dimensional facets of an n-simplex S guarantee that S has no obtuse dihedral…

环与代数 · 数学 2015-12-10 Jan Brandts , Apo Cihangir

Given a non circular spacial closed curve whose total torsion is an integer multiple of $2\pi$, we construct a germ of a smooth surface that contains it as a hyperbolic principal cycle.

微分几何 · 数学 2010-03-23 R. Garcia , L. F. Mello , J. Sotomayor

We determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $n\ge 4$, and thus we answer affirmatively the problem whether the unique digraph…

组合数学 · 数学 2013-05-02 Jianping Li , Bo Zhou

We provide an explicit geometric algorithm involving only ruler and compass constructions in order to specify the specular reflection point on the surface of a reflecting sphere of radius $r$ given two focal points $A$ and $B$ lying outside…

历史与综述 · 数学 2017-03-21 Nikolaos K. Kollas

We introduce cosymplectic circles and cosymplectic spheres, which are the analogues in the cosymplectic setting of contact circles and contact spheres. We provide a complete classification of compact 3-manifolds that admit a cosymplectic…

微分几何 · 数学 2015-12-11 Beniamino Cappelletti-Montano , Antonio De Nicola , Ivan Yudin

We consider triangle faced convex polyhedra inscribed in the unit sphere $S^2$ in ${\Bbb{R}}^3$. One way of measuring their deviation from regular polyhedra with triangular faces is to consider the quotient of the lengths of the longest and…

度量几何 · 数学 2019-09-09 E. Makai,