Related papers: Bounded m-ary Patch-Width Are Equivalent For m > 2
In this paper, firstly, for some $4n$-dimensional almost complex manifolds $M_{i}, ~1\le i \le \alpha$, we prove that $\left(\sharp_{i=1}^{\alpha} M_{i}\right) \sharp (\alpha{-}1) \mathbb{C} P^{2n}$ must admits an almost complex structure,…
The maximum matching width is a width-parameter that is defined on a branch-decomposition over the vertex set of a graph. The size of a maximum matching in the bipartite graph is used as a cut-function. In this paper, we characterize the…
The main conjecture on maximum distance separable (MDS) codes states that, execpt for some special cases, the maximum length of a q-ary linear MDS code is q+1. This conjecture does not hold true for near maximum distance separable codes…
Merge-width, recently introduced by Dreier and Toru\'nczyk, is a common generalisation of bounded expansion classes and twin-width for which the first-order model checking problem remains tractable. We prove that a number of basic…
Every bounded definable open set is a union of finitely many open strong cells in a weakly o-minimal expansion of a real closed field. We prove this fact and another theorem similar to it.
A large number of NP-hard graph problems become polynomial-time solvable on graph classes where the mim-width is bounded and quickly computable. Hence, when solving such problems on special graph classes, it is helpful to know whether the…
We describe all binary simple homogeneous structures M in terms of 0-definable equivalence relations on M, which "coordinatize" M and control dividing, and extension properties that respect these equivalence relations.
Known results are reviewed about the bounded and convex bounded variants, bT and cbT, of a topology T on a real Banach space. The focus is on the cases of T = w(P*, P) and of T = m(P*, P), which are the weak* and the Mackey topologies on a…
We construct a Banach space satisfying that the nearest point map (also called proximity mapping or metric projection) onto any compact and convex subset is continuous but not uniformly continuous. The space we construct is locally…
In a paper from 2015, Ding et al. (IEEE Trans. IT, May 2015) conjectured that for odd $m$, the minimum distance of the binary BCH code of length $2^m-1$ and designed distance $2^{m-2}+1$ is equal to the Bose distance calculated in the same…
In this short note, using results of Bourgain, Fremlin, and Talagrand \cite{BFT}, we show that for a countable structure $M$, a saturated elementary extension $M^*$ of $M$ and a formula $\phi(x,y)$ the following are equivalent: (i)…
We consider perfect 1-error correcting codes over a finite field with $q$ elements (briefly $q$-ary 1-perfect codes). In this paper, a generalized concatenation construction for $q$-ary 1-perfect codes is presented that allows us to…
Nancy G. Kinnersley and Michael A. Langston has determined the excluded minors for the class of graphs with path-width at most two by computer. Their list consisted of 110 graphs. Such a long list is difficult to handle and gives no insight…
A graph is path-pairable if for any pairing of its vertices there exist edge disjoint paths joining the vertices in each pair. We obtain sharp bounds on the maximum possible diameter of path-pairable graphs which either have a given number…
The $q$-ary block codes with two distances $d$ and $d+1$ are considered. Several constructions of such codes are given, as in the linear case all codes can be obtained by a simple modification of linear equidistant codes. Upper bounds for…
Given any connected, open 3-manifold $U$ having finitely many ends, a non-compact 3-manifold $M$ is constructed having the following properties: the interior of $M$ is homeomorphic to $U$; the boundary of $M$ is the disjoint union of…
We study the structure of the language of binary cube-free words. Namely, we are interested in the cube-free words that cannot be infinitely extended preserving cube-freeness. We show the existence of such words with arbitrarily long finite…
We consider M theory 5-branes with compact transverse dimensions. In certain limits the theory on the 5-brane decouples and defines ``little string theories'' in 5+1 dimensions. We show that the familiar structure of IIA/IIB,M,F- theory in…
The width of a delta-matroid is the difference in size between a maximal and minimal feasible set. We give a Rough Structure Theorem for delta-matroids that admit a twist of width one. We apply this theorem to give an excluded minor…
The finite satisfiability problem of monadic second order logic is decidable only on classes of structures of bounded tree-width by the classic result of Seese (1991). We prove the following problem is decidable: Input: (i) A monadic second…