English
Related papers

Related papers: Colorful simplicial depth, Minkowski sums, and gen…

200 papers

We study surfaces in Euclidean space constructed by the sum of two curves or that are graphs of the product of two functions. We consider the problem to determine all these surfaces with constant Gauss curvature. We extend the results to…

Differential Geometry · Mathematics 2014-10-10 Rafael López , Marilena Moruz

Following D.B. Karaguezian, V. Reiner, and M.L. Wachs (Matching Complexes, Bounded Degree Graph Complexes, and Weight Spaces of $GL$-Complexes, Journal of Algebra 2001) we study the connectivity degree and shellability of multiple…

Combinatorics · Mathematics 2015-10-20 Duško Jojić , Siniša T. Vrećica , Rade T. Živaljević

Let n>1 be a number. Let Gn be the hypergraph of all rectangles in an n-dimensional Euclidean space. It is consistent that ZF+DC holds, the chromatic number of Gn is countable, yet the chromatic number of Gn+1 is uncountable.

Logic · Mathematics 2021-08-24 Jindrich Zapletal

We find some general lower bounds of the sum of certain families of multigraded Betti numbers of any simplicial complex with a vertex coloring.

Algebraic Topology · Mathematics 2019-02-04 Li Yu

We show that every finite-dimensional Euclidean space contains compact universal differentiability sets of upper Minkowski dimension one. In other words, there are compact sets $S$ of upper Minkowski dimension one such that every Lipschitz…

Functional Analysis · Mathematics 2016-01-05 Michael Dymond , Olga Maleva

This paper continues the study of a class of compact convex hypersurfaces in Euclidean space $R^{n+1}, ~n \geq 1$, which are boundaries of compact convex bodies obtained by taking the intersection of (solid) confocal paraboloids of…

Differential Geometry · Mathematics 2007-05-23 Vladimir Oliker

The aim of this paper is twofold. On one hand the generalized Minkowski sets are defined and characterized. On the other hand, the Motzkin decomposable sets, along with their epigraphic versions are considered and characterized in new ways.…

Optimization and Control · Mathematics 2023-01-24 Juan Enrique Martínez-Legaz , Cornel Pintea

The Shapley-Folkman theorem is a statement about the Minkowski sum of (non-convex) sets, expressing the closeness of the Minkowski sum to convexity in a quantitative manner. This paper establishes similar theorems for integrally convex…

Combinatorics · Mathematics 2024-08-20 Kazuo Murota , Akihisa Tamura

The Lovasz theta function provides a lower bound for the chromatic number of finite graphs based on the solution of a semidefinite program. In this paper we generalize it so that it gives a lower bound for the measurable chromatic number of…

Combinatorics · Mathematics 2009-11-21 Christine Bachoc , Gabriele Nebe , Fernando Mario de Oliveira Filho , Frank Vallentin

We discuss a notion of discrete conformal equivalence for decorated piecewise euclidean surfaces (PE-surface), that is, PE-surfaces with a choice of circle about each vertex. It is closely related to inversive distance and hyperideal circle…

Geometric Topology · Mathematics 2023-06-13 Alexander I. Bobenko , Carl O. R. Lutz

Supermanifolds provide a very natural ground to understand and handle supersymmetry from a geometric point of view; supersymmetry in $d=3,4,6$ and $10$ dimensions is also deeply related to the normed division algebras. In this paper we want…

High Energy Physics - Theory · Physics 2016-03-23 Rita Fioresi , Emanuele Latini

A cyclic coloring of a plane graph $G$ is a coloring of its vertices such that vertices incident with the same face have distinct colors. The minimum number of colors in a cyclic coloring of a plane graph $G$ is its cyclic chromatic number…

Combinatorics · Mathematics 2020-09-23 Stanislav Jendrol , Roman Sotak

A graph is pseudo-outerplanar if each of its blocks has an embedding in the plane so that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. In this paper, the…

Combinatorics · Mathematics 2011-08-26 Xin Zhang , Guizhen Liu

We investigate degree bounds for fields of rational invariants of representations of finite groups. We prove many cases of a bound for $\mathbb{Z}/p\mathbb{Z}$ conjectured by Blum-Smith, Garcia, Hidalgo, and Rodriguez. For arbitrary groups,…

Commutative Algebra · Mathematics 2026-04-22 Ben Blum-Smith , Sylvan Crane , Karla Guzman , Alexis Menenses , Maxine Song-Hurewitz

We consider $d$-dimensional simplicial complexes which can be PL embedded in the $2d$-dimensional euclidean space. In short, we show that in any such complex, for any three vertices, the intersection of the link-complexes of the vertices is…

Computational Geometry · Computer Science 2020-01-28 Salman Parsa

It is surprising, but an established fact that the field of Elementary Geometry referring to normed spaces (= Minkowski spaces) is not a systematically developed discipline. There are many natural notions and problems of elementary and…

Metric Geometry · Mathematics 2016-02-22 Undine Leopold , Horst Martini

Equivalences between conformal foliations on Euclidean $3$-space, Hermitian structures on Euclidean $4$-space, shear-free ray congruences on Minkowski $4$-space, and holomorphic foliations on complex $4$-space are explained geometrically…

dg-ga · Mathematics 2008-02-03 P. Baird , J. C. Wood

Conformal symmetry is taken as an attribute of theories of massless fields in manifolds with specific dimensionalities. This paper shows that this is not an absolute truth; it is a consequence of the mathematical representation used for the…

High Energy Physics - Theory · Physics 2007-05-23 Manoelito M de Souza

If all but two vertices of a triangulated sphere have degrees divisible by $k$, then the exceptional vertices are not adjacent. This theorem is proved for $k=2$ with the help of the coloring monodromy. For $k = 3, 4, 5$ colorings by the…

Combinatorics · Mathematics 2015-11-23 Ivan Izmestiev

Square coloring is a variant of graph coloring where vertices within distance two must receive different colors. When considering planar graphs, the most famous conjecture (Wegner, 1977) states that $\frac32\Delta+1$ colors are sufficient…

Combinatorics · Mathematics 2021-12-24 Nicolas Bousquet , Quentin Deschamps , Lucas de Meyer , Théo Pierron
‹ Prev 1 8 9 10 Next ›