AbstractWe review properties of acute and non-obtuse simplices, and of ortho-simplices and path-simplices. Dissection of path-simplices is considered, which leads to a new result: generalization of Coxeter’s trisection of a path-tetrahedron into three path-subtetrahedra to arbitrary spatial dimension n. Moreover, following earlier results by Korotov and Křížek, we show that applying this procedure recursively in the proper way leads to a self-similar path-simplicial refinement towards a chosen vertex of the original path-simplex
AbstractWe connect k-triangulations of a convex n-gon to the theory of Schubert polynomials. We use ...
In a previous paper the author has associated with every inverse system of compact CW-complexes X wi...
peer reviewedMotivated by the problem of bounding the number of iterations of the Simplex algorithm ...
AbstractWe review properties of acute and non-obtuse simplices, and of ortho-simplices and path-simp...
AbstractSome results for vertex angles of a simplex are given. A theorem of Cho [1] on dihedral angl...
This thesis focuses on the study of certain special classes of n-simplices that occur in the context...
This paper surveys some results on acute and nonobtuse simplices and associated spatial partitions. ...
In their development of the Field D* algorithm, Ferguson et. al. prove that a path through a unit le...
Let Pn be a convex n-gon in the plane, n ⩾ 3. Consider Σn, the collection of all sets of mutually no...
summary:A $0/1$-simplex is the convex hull of $n+1$ affinely independent vertices of the unit $n$-cu...
summary:A $0/1$-simplex is the convex hull of $n+1$ affinely independent vertices of the unit $n$-cu...
In a previous paper the author has associated with every inverse system of compact CW-complexes X wi...
AbstractWe establish in this paper some inequalities for vertex distances of two simplices, and give...
AbstractThis paper is concerned with estimating ϕ(n), the minimum number of n-simplices required to ...
Steenrod cohomology operations are algebraic tools for distinguishing non–homeomorphic topological ...
AbstractWe connect k-triangulations of a convex n-gon to the theory of Schubert polynomials. We use ...
In a previous paper the author has associated with every inverse system of compact CW-complexes X wi...
peer reviewedMotivated by the problem of bounding the number of iterations of the Simplex algorithm ...
AbstractWe review properties of acute and non-obtuse simplices, and of ortho-simplices and path-simp...
AbstractSome results for vertex angles of a simplex are given. A theorem of Cho [1] on dihedral angl...
This thesis focuses on the study of certain special classes of n-simplices that occur in the context...
This paper surveys some results on acute and nonobtuse simplices and associated spatial partitions. ...
In their development of the Field D* algorithm, Ferguson et. al. prove that a path through a unit le...
Let Pn be a convex n-gon in the plane, n ⩾ 3. Consider Σn, the collection of all sets of mutually no...
summary:A $0/1$-simplex is the convex hull of $n+1$ affinely independent vertices of the unit $n$-cu...
summary:A $0/1$-simplex is the convex hull of $n+1$ affinely independent vertices of the unit $n$-cu...
In a previous paper the author has associated with every inverse system of compact CW-complexes X wi...
AbstractWe establish in this paper some inequalities for vertex distances of two simplices, and give...
AbstractThis paper is concerned with estimating ϕ(n), the minimum number of n-simplices required to ...
Steenrod cohomology operations are algebraic tools for distinguishing non–homeomorphic topological ...
AbstractWe connect k-triangulations of a convex n-gon to the theory of Schubert polynomials. We use ...
In a previous paper the author has associated with every inverse system of compact CW-complexes X wi...
peer reviewedMotivated by the problem of bounding the number of iterations of the Simplex algorithm ...