Related papers: Bounded m-ary Patch-Width Are Equivalent For m > 2
We study the problem of guarding the boundary of a simple polygon with a minimum number of guards such that each guard covers a contiguous portion of the boundary. First, we present a simple greedy algorithm for this problem that returns a…
We study M-separability as well as some other combinatorial versions of separability. In particular, we show that the set-theoretic hypothesis b=d implies that the class of selectively separable spaces is not closed under finite products,…
Let M be a paracompact differentiable manifold, A a local algebra and M^{A} a manifold of infinitely near points on M of kind A. We define the notion of A-Poisson manifold on M^{A}. We show that when M is a Poisson manifold, then M^{A} is…
We show that the obstruction to the existence of a strict symmetric monoidal structure on a monoidal stack $\cal C$ is determined by a commutator biextension associated to $\cal C$, and that this biextension is alternating under an…
We calculate the bridge distance for $m$-bridge knots/links in the $3$-sphere with sufficiently complicated $2m$-plat projections. In particular we show that if the underlying braid of the plat has $n - 1$ rows of twists and all its…
In the setting of constructive mathematics, we suggest and study a framework for decidability of properties, which allows for finer distinctions than just "decidable, semidecidable, or undecidable". We work in homotopy type theory and use…
Highly connected and yet sparse graphs (such as expanders or graphs of high treewidth) are fundamental, widely applicable and extensively studied combinatorial objects. We initiate the study of such highly connected graphs that are, in…
We consider a general fibre of given length in a generic projection of a va- riety. Under the assumption that the fibre is of local embedding dimension 2 or less, an assumption which can be checked in many cases, we prove that the fibre is…
Several different measures for digraph width have appeared in the last few years. However, none of them shares all the "nice" properties of treewidth: First, being \emph{algorithmically useful} i.e. admitting polynomial-time algorithms for…
For any minor-closed class of matroids over a fixed finite field, we state an exact structural characterization for the sufficiently connected matroids in the class. We also state a number of conjectures that might be approachable using the…
We show that any binary $(n=2^m-3, 2^{n-m}, 3)$ code $C_1$ is a part of an equitable partition (perfect coloring) $\{C_1,C_2,C_3,C_4\}$ of the $n$-cube with the parameters $((0,1,n-1,0)(1,0,n-1,0)(1,1,n-4,2)(0,0,n-1,1))$. Now the…
The quality of the narrow-width approximation is examined for partonic and convolved cross sections of sample processes. By comparison with accurate predictions significant limitations are revealed.
We examine the possibility that the strong CP problem is solved by string-theoretic axions in strong-coupling limit of the E_8 x E_8 heterotic string theory (M-theory). We first discuss some generic features of gauge kinetic functions in…
To construct a Paley graph, we fix a finite field and consider its elements as vertices of the Paley graph. Two vertices are connected by an edge if their difference is a square in the field. We will study some important properties of the…
New classes of distance-constrained structures are introduced, namely string-node nets and meshes, a mesh being a string-node net for which the nodes are dense in the strings. Various construction schemes are given including the minimal…
In this talk we review the problem of constructing a developable surface patch bounded by two rational or NURBS (Non-Uniform Rational B-spline) curves.
Measuring the similarity between patches in images is a fundamental building block in various tasks. Naturally, the patch-size has a major impact on the matching quality, and on the consequent application performance. We try to use large…
Given an additive equational category with a closed symmetric monoidal structure and a potential dualizing object, we find sufficient conditions that the category of topological objects over that category has a good notion of full…
Lower bounds on the generation of smooth bi-cubic surfaces imply that geometrically smooth ($G^1$) constructions need to satisfy conditions on the connectivity and layout. In particular, quadrilateral meshes of arbitrary topology can not in…
Graphs with bounded treewidth and bounded maximum degree are known to have tree-partitions of bounded width. What can be said if the bounded treewidth assumption is strengthened to bounded pathwidth? We prove that every graph with bounded…