The conjecturing process: perspectives in theory and implications in practice

In this paper we analyze different types and stages of the conjecturing process. A classification of conjectures is discussed. A variety of problems that could lead to conjectures are considered from the didactical point of view. Results from a number of research studies are used to identify and investigate a number of questions related to the theoretical background of conjecturing as well as practical implications in the learning process

The conjecturing process: perspectives in theory and implications in practice

[Abstract]: In this paper we analyze different types and stages of the conjecturing process. A classification of conjectures is discussed. A variety of problems that could lead to conjectures are considered from the didactical point of view. Results from a number of research studies are used to identify and investigate a number of questions related to the theoretical background of conjecturing as well as practical implications in the learning process

Lattice polytopes in coding theory

In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes. As an application, we give new formulas for the minimum distance of generalized toric codes for special lattice point configurations.Comment: 11 pages, 3 figure

The Fermat-Torricelli problem in normed planes and spaces

We investigate the Fermat-Torricelli problem in d-dimensional real normed spaces or Minkowski spaces, mainly for d=2. Our approach is to study the Fermat-Torricelli locus in a geometric way. We present many new results, as well as give an exposition of known results that are scattered in various sources, with proofs for some of them. Together, these results can be considered to be a minitheory of the Fermat-Torricelli problem in Minkowski spaces and especially in Minkowski planes. This demonstrates that substantial results about locational problems valid for all norms can be found using a geometric approach

Pattern Matching for sets of segments

In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of two main parts. In the first, we address problems and measures that relate to collections of orthogonal line segments in the plane. Such collections arise naturally from problems in mapping buildings and robot exploration. We propose a new measure of segment similarity called a \emph{coverage measure}, and present efficient algorithms for maximising this measure between sets of axis-parallel segments under translations. Our algorithms run in time O(n^3\polylog n) in the general case, and run in time O(n^2\polylog n) for the case when all segments are horizontal. In addition, we show that when restricted to translations that are only vertical, the Hausdorff distance between two sets of horizontal segments can be computed in time roughly O(n^{3/2}{\sl polylog}n). These algorithms form significant improvements over the general algorithm of Chew et al. that takes time $O(n^4 \log^2 n)$. In the second part of this paper we address the problem of matching polygonal chains. We study the well known \Frd, and present the first algorithm for computing the \Frd under general translations. Our methods also yield algorithms for computing a generalization of the \Fr distance, and we also present a simple approximation algorithm for the \Frd that runs in time O(n^2\polylog n).Comment: To appear in the 12 ACM Symposium on Discrete Algorithms, Jan 200

Topology of geometric joins

We consider the geometric join of a family of subsets of the Euclidean space. This is a construction frequently used in the (colorful) Carath\'eodory and Tverberg theorems, and their relatives. We conjecture that when the family has at least $d+1$ sets, where $d$ is the dimension of the space, then the geometric join is contractible. We are able to prove this when $d$ equals $2$ and $3$, while for larger $d$ we show that the geometric join is contractible provided the number of sets is quadratic in $d$. We also consider a matroid generalization of geometric joins and provide similar bounds in this case

Convex politopes and quantum separability

We advance a novel perspective of the entanglement issue that appeals to the Schlienz-Mahler measure [Phys. Rev. A 52, 4396 (1995)]. Related to it, we propose an criterium based on the consideration of convex subsets of quantum states. This criterium generalizes a property of product states to convex subsets (of the set of quantum-states) that is able to uncover a new geometrical property of the separability property