Related papers: Harmonic Center of an n-Simplex: Some Properties
Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound…
The aim of this paper is to study symmetries of linearly singular differential equations, namely, equations that can not be written in normal form because the derivatives are multiplied by a singular linear operator. The concept of…
The central problem in computational algebraic topology is the computation of the homotopy groups of a given space, represented as a simplicial set. Algorithms have been found which achieve this, but the running times depend on the size of…
Motivated by questions arising in signal processing, computational complexity, and other areas, we study the ranks and border ranks of symmetric tensors using geometric methods. We provide improved lower bounds for the rank of a symmetric…
Symmetric quasiconvexity plays a key role for energy minimization in geometrically linear elasticity theory. Due to the complexity of this notion, a common approach is to retreat to necessary and sufficient conditions that are easier to…
Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…
Planar commutative n-complex numbers of the form u=x_0+h_1x_1+h_2x_2+...+h_{n-1}x_{n-1} are introduced in an even number n of dimensions, the variables x_0,...,x_{n-1} being real numbers. The planar n-complex numbers can be described by the…
Planar central configurations can be seen as critical points of the reduced potential or solutions of a system of equations. By the homogeneity and invariance of the potential with respect to SO(2), it is possible to see that the…
In this paper, we propose a method to design state feedback harmonic control laws that assign the closed loop poles of a linear harmonic model to some desired locations. The procedure is based on the solution of an infinite-dimensional…
Given a real, symmetric matrix S, we define the slice through S as being the connected component containing S of two orbits under conjugation: the first by the orthogonal group, and the second by the upper triangular group. We describe some…
Let $H$ be a real Hilbert space. In this short note, using some of the properties of bounded linear operators with closed range defined on $H$, certain bounds for a specific convex subset of the solution set of infinite linear…
Generalized Heisenberg algebras $\H(f)$ for any polynomial $f(h)\in\C[h]$ have been used to explain various physical systems and many physical phenomena for the last 20 years. In this paper, we first obtain the center of $\H(f)$, and the…
In this work we extend the theory of the classical Hardy space $H^1$ to the rational Dunkl setting. Specifically, let $\Delta$ be the Dunkl Laplacian on a Euclidean space $\mathbb{R}^N$. On the half-space $\mathbb{R}_+\times\mathbb{R}^N$,…
Finite simplex lattice models are used in different branches of science, e.g., in condensed matter physics, when studying frustrated magnetic systems and non-Hermitian localization phenomena; or in chemistry, when describing experiments…
If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…
The concept of an $i$-symmetrization is introduced, which provides a convenient framework for most of the familiar symmetrization processes on convex sets. Various properties of $i$-symmetrizations are introduced and the relations between…
We study $d$-dimensional simplicial complexes that are PL embeddable in $\mathbb{R}^{d+1}$. It is shown that such a complex must satisfy a certain homological condition. The existence of this obstruction allows us to provide a systematic…
We generalise the definition of the characteristic of an integral triangle to integral simplices and prove that each simplex in an integral point set has the same characteristic. This theorem is used for an efficient construction algorithm…
The matching complex of a graph is the simplicial complex whose vertex set is the set of edges of the graph with a face for each independent set of edges. In this paper we completely characterize the pairs (graph, matching complex) for…
A non-equilateral triangle in a Euclidean plane has exactly two isogonic and two isodynamic points. There are a number of different but equivalent characterizations of these triangle centers. The aim of this paper is to work out…