Related papers: Small cones of m-hemimetrics

We introduce some compact orbifolds on which there is a certain finite group action having a simple convex polytope as the orbit space. We compute the orbifold fundamental group and homology groups of these orbifolds. We calculate the…

We construct minimal $m$-dimensional immersions in $\R^{m+1}$, equipped with a $C^{1, \alpha}$ metric, $\alpha\in [0,1)$, with a sequence of \emph{catenoidal necks} or \emph{floating disks} converging to an isolated, multiplicity $2$,…

An M-partition of a positive integer m is a partition with as few parts as possible such that any positive integer less than m has a partition made up of parts taken from that partition of m. This is equivalent to partitioning a weight m so…

Finite quasi semimetrics on $n$ can be thought of as nonnegative valuations on the edges of a complete directed graph on $n$ vertices satisfying all possible triangle inequalities. They comprise a polyhedral cone whose symmetry groups were…

We study cylindric partitions with two-element profiles using MacMahon's partition analysis. We find explicit formulas for the generating functions of the number of cylindric partitions by first finding the recurrences using partition…

In this paper, cylindric partitions into profiles $c=(1,1)$ and $c=(2,0)$ are considered. The generating functions into unrestricted cylindric partitions and cylindric partitions into distinct parts with these profiles are constructed. The…

Partial permutohedra are lattice polytopes which were recently introduced and studied by Heuer and Striker. For positive integers $m$ and $n$, the partial permutohedron $\mathcal{P}(m,n)$ is the convex hull of all vectors in…

Given $m\in \mathbb{N},$ a numerical semigroup with multiplicity $m$ is called packed numerical semigroup if its minimal generating set is included in $\{m,m+1,\ldots, 2m-1\}.$ In this work, packed numerical semigroups are used to built the…

Positive semidefinite matrices partitioned into a small number of Hermitian blocks have a remarkable property. Such a matrix may be written in a simple way from the sum of its diagonal blocks

We introduce the notion of a chopped and sliced cone in combinatorial geometry and prove two structure theorems for the number of integral points in the individual slices of such a cone. We observe that this notion applies to weight…

Skeletal polyhedra and polygonal complexes are finite or infinite periodic structures in 3-space with interesting geometric, combinatorial, and algebraic properties. These structures can be viewed as finite or infinite periodic graphs…

In a previous work arXiv:physics/0611108v2, it was shown that the volume spanned by a molecular system in its conformational space can be effectively bounded by a polyhedral cone, this cone is described by means of a simple combinatorial…

Asymptotic formulas of the number of various partitions are studied, like 3-colored partitions, concave partitions, certain plane partitions, partitions without small parts, the number of p-rings.

Topics concerning metric dimension related invariants in graphs are nowadays intensively studied. This compendium of combinatorial and computational results on this topic is an attempt of surveying those contributions that are of the…

A coordinate cone in R^n is an intersection of some coordinate hyperplanes and open coordinate half-spaces. A semi-monotone set is a defnable in an o-minimal structure over the reals, open bounded subset of R^n such that its intersection…

We continue our study about the half-wormhole proposal. By generalizing the original proposal of half-wormhole we propose a new way to detect half-wormholes. The crucial idea is to decompose the observables into self-averaged sector and…

In this article, we study the geometry of plane curves obtained by three sections and another section given as their sum on certain rational elliptic surfaces. We make use of Mumford representations of semi-reduced divisors in order to…

Quasi-median graphs are a tool commonly used by evolutionary biologists to visualise the evolution of molecular sequences. As with any graph, a quasi-median graph can contain cut vertices, that is, vertices whose removal disconnect the…

We show that any polyhedron forming a topological ball with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face to face. The result generalizes to non-simply-connected polyhedra satisfying an…

In this paper we consider a partial overdetermined mixed boundary value problem in domains inside a cone as in [18]. We show that in cones having an isoperimetric property the only domains which admit a solution and which minimize a…