The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 181 –
200 of
613
In this paper we present factorization theorems for strong maps between matroids of arbitrary cardinality. Moreover, we present a new way to prove the factorization theorem for strong maps between finite matroids.
The problem of utilizing facet reflections to bring a point outside of a convex polytope to inside has not been studied explicitly in the literature. Here we introduce two algorithms that complete the task in finite iterations. The first algorithm generates multiple solutions on the plane, and can be readily utilized in creating games on a plane or as a level generation method for video games. The second algorithm is a new efficient way to bring infeasible starting points of an optimization problem...
We prove that Platonic and some Archimedean polyhedra have the fixed point property in a non-classical sense.
A classification of dihedral folding tessellations of the sphere whose prototiles are a kite and an equilateral or isosceles triangle was obtained in recent four papers by Avelino and Santos (2012, 2013, 2014 and 2015). In this paper we extend this classification, presenting all dihedral folding tessellations of the sphere by kites and scalene triangles in which the shorter side of the kite is equal to the longest side of the triangle. Within two possible cases of adjacency, only one will be addressed....
Currently displaying 181 –
200 of
613