English
Related papers

Related papers: A bound on the Carath\'eodory number

200 papers

We classify closed, simply connected $n$-manifolds of non-negative sectional curvature admitting an isometric torus action of maximal symmetry rank in dimensions $2\leq n\leq 6$. In dimensions $3k$, $k=1,2$ there is only one such manifold…

Differential Geometry · Mathematics 2012-07-27 Fernando Galaz-Garcia , Catherine Searle

In this paper we give a geometric characterization of the cones of toric varieties that are complete intersections. In particular, we prove that the class of complete intersection cones is the smallest class of cones which is closed under…

Algebraic Geometry · Mathematics 2007-05-23 Nickolas Michelacakis , Apostolos Thoma

For every integer $k\geq 2$ and every $R>1$ one can find a dimension $n$ and construct a symmetric convex body $K\subset\mathbb{R}^n$ with $\text{diam}\,Q_{k-1}(K)\geq R\cdot\text{diam}\,Q_k(K)$, where $Q_k(K)$ denotes the $k$-convex hull…

Metric Geometry · Mathematics 2025-10-01 Davide Ravasini

Let $K$ be a maximal lattice-free set in $\mathbb{R}^d$, that is, $K$ is convex and closed subset of $\mathbb{R}^d$, the interior of $K$ does not cointain points of $\mathbb{Z}^d$ and $K$ is inclusion-maximal with respect to the above…

Optimization and Control · Mathematics 2011-10-06 Gennadiy Averkov

For a compact convex subset K with non-empty interior in a finite-dimensional vector space, let G be the group of all smooth diffeomorphisms of K which fix the boundary of K pointwise. We show that G is a C^0-regular infinite-dimensional…

Group Theory · Mathematics 2016-03-22 Helge Glockner , Karl-Hermann Neeb

The rank rk(G) of a profinite group G is the supremum of d(H), where H ranges over all closed subgroups of G and d(H) denotes the minimal cardinality of a topological generating set for H. A compact topological group G admits the structure…

Group Theory · Mathematics 2011-01-06 B. Klopsch

The number of perfect matchings of a $k$-pfaffian graph can be counted by computing a linear combination of the pfaffians of $k$ matrices. The pfaffian number of a graph $G$ is the smallest integer $k$ such that $G$ is $k$-pfaffian. We…

Combinatorics · Mathematics 2026-03-03 Enrique Junchaya , Alberto Alexandre Assis Miranda , Cláudio L. Lucchesi

Let $q$ be an odd power of a prime $p$, and $S \subset \mathbb{F}_q^*$ such that $S=-S$ and $S/S \neq \mathbb{F}_q^*$. We show that the clique number of the Cayley graph $\operatorname{Cay}(\mathbb{F}_q^+,S)$ is at most…

Combinatorics · Mathematics 2025-11-26 Chi Hoi Yip

For any elements b,c of a number field K, let G(b,c) denote the backwards orbit of b under the map f_c: C-->C given by f_c(x)=x^2+c. We prove an upper bound on the number of elements of G(b,c) whose degree over K is at most some constant B.…

Given a closed, convex and pointed cone K in R^n, we present a result which infers K-irreducibility of sets of K-quasipositive matrices from strong connectedness of certain bipartite digraphs. The matrix-sets are defined via products, and…

Combinatorics · Mathematics 2013-01-15 Murad Banaji , Andrew Burbanks

Hadwiger's conjecture asserts that every graph without a $K_t$-minor is $(t-1)$-colorable. It is known that the exact version of Hadwiger's conjecture does not extend to list coloring, but it has been conjectured by Kawarabayashi and Mohar…

Combinatorics · Mathematics 2021-10-19 Raphael Steiner

The \emph{$k$-restricted edge-connectivity} of a graph $G$, denoted by $\lambda_k(G)$, is defined as the minimum size of an edge set whose removal leaves exactly two connected components each containing at least $k$ vertices. This graph…

Data Structures and Algorithms · Computer Science 2016-09-20 Luis Pedro Montejano , Ignasi Sau

We prove results relative to the problem of finding sharp bounds for the affine invariant $P(K)=V(\Pi K)/V^{d-1}(K)$. Namely, we prove that if $K$ is a 3-dimensional zonoid of volume 1, then its second projection body $\Pi^2K$ is contained…

Metric Geometry · Mathematics 2014-09-17 Christos Saroglou

If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…

Combinatorics · Mathematics 2013-03-25 Michal Adamaszek

It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…

Complex Variables · Mathematics 2020-09-29 Purvi Gupta , Rasul Shafikov

We consider the integer points in a unimodular cone K ordered by a lexicographic rule defined by a lattice basis. To each integer point x in K we associate a family of inequalities (lex-cuts) that defines the convex hull of the integer…

Optimization and Control · Mathematics 2020-07-29 Michele Conforti , Marianna De Santis , Marco Di Summa , Francesco Rinaldi

We provide a lower bound for the number of components of the algebraic monodromy group in the situation of a $K3$ surface over a number field $k$. In the CM case, our bound is sharp. As an application, we describe, in the case of CM, the…

Algebraic Geometry · Mathematics 2024-02-15 Andreas-Stephan Elsenhans , Jörg Jahnel

Let P be a planar n-point set. A k-partition of P is a subdivision of P into n/k parts of roughly equal size and a sequence of triangles such that each part is contained in a triangle. A line is k-shallow if it has at most k points of P…

Computational Geometry · Computer Science 2012-02-03 Wolfgang Mulzer , Daniel Werner

We consider the following measure of symmetry of a convex n-dimensional body K: $\rho(K)$ is the smallest constant for which there is a point x in K such that for partitions of K by an n-1-dimensional hyperplane passing through x the ratio…

Metric Geometry · Mathematics 2013-02-11 Stanislaw J. Szarek

We report here a computation giving the complete list of facets for the cut polytopes over several very symmetric graphs with $15-30$ edges, including $K_8$, $K_{3,3,3}$, $K_{1,4,4}$, $K_{5,5}$, some other $K_{l,m}$, $K_{1,l,m}$, $Prism_7,…

Combinatorics · Mathematics 2015-05-15 Michel Deza , Mathieu Dutour Sikiric