相关论文: A Simple Optimal Binary Representation of Mosaic F…
Matrices are two-dimensional data structures allowing one to conceptually organize information. For example, adjacency matrices are useful to store the links of a network; correlation matrices are simple ways to arrange gene co-expression…
Recently, there has been interest in representing single graphs by multiple drawings; for example, using graph stories, storyplans, or uncrossed collections. In this paper, we apply this idea to orthogonal graph drawing. Due to the…
This paper presents an extreme floorplan reconstruction task, a new benchmark for the task, and a neural architecture as a solution. Given a partial floorplan reconstruction inferred or curated from panorama images, the task is to…
In this paper, we propose to enumerate all different configurations belonging to a specific class of fractals: A binary initial tile is selected and a finite recursive tiling process is engaged to produce auto-similar binary patterns. For…
Floor planning is an important and difficult task in architecture. When planning office buildings, rooms that belong to the same organisational unit should be placed close to each other. This leads to the following NP-hard mathematical…
Questions that seek to determine whether a hyperplane arrangement property, be it geometric, arithmetic or topological, is of a combinatorial nature (that is determined by the intersection lattice) are abundant in the literature. To tackle…
An \emph{obstacle representation} of a graph consists of a set of polygonal obstacles and a distinct point for each vertex such that two points see each other if and only if the corresponding vertices are adjacent. Obstacle representations…
In Parts I and II we showed that e, $\nu$ propagators can be derived from rotation invariant projection operators, thereby providing examples of how quantities with spacetime symmetry can be obtained by constraining rotationally symmetric…
A rooted planar map is a connected graph embedded in the 2-sphere, with one edge marked and assigned an orientation. A term of the pure lambda calculus is said to be linear if every variable is used exactly once, normal if it contains no…
The representation theories of the SU(2)$_k$-extended $N$=4 superconformal algebras (SCAs) with $arbitrary$ level $k$ are developed being based on their Feigin-Fuchs representations found recently by the present author. A basic unit of the…
In this paper we prove new lower bounds for the maximal size of permutation codes by connecting the theory of permutation codes with the theory of linear block codes. More specifically, using the columns of a parity check matrix of an…
Webs are planar graphs with boundary that describe morphisms in a diagrammatic representation category for $\mathfrak{sl}_k$. They are studied extensively by knot theorists because braiding maps provide a categorical way to express link…
A binary matrix can be scanned by moving a fixed rectangular window (submatrix) across it, rather like examining it closely under a microscope. With each viewing, a convenient measurement is the number of 1s visible in the window, which…
Schietgat, Ramon and Bruynooghe proposed a polynomial-time algorithm for computing a maximum common subgraph under the block-and-bridge preserving subgraph isomorphism (BBP-MCS) for outerplanar graphs. We show that the article contains the…
Conformal blocks for correlation functions of tensor operators play an increasingly important role for the conformal bootstrap programme. We develop a universal approach to such spinning blocks through the harmonic analysis of certain…
We give an algorithm to morph planar graph drawings that achieves small grid size at the expense of allowing a constant number of bends on each edge. The input is an $n$-vertex planar graph and two planar straight-line drawings of the graph…
This article presents new enumerative results related to symmetric planar maps. In the first part a new way of enumerating rooted simple quadrangulations and rooted simple triangulations is presented, based on the description of two…
The projective space of order $n$ over a finite field $\F_q$ is a set of all subspaces of the vector space $\F_q^{n}$. In this work, we consider error-correcting codes in the projective space, focusing mainly on constant dimension codes. We…
The problem of rectangle tiling binary arrays is defined as follows. Given an $n \times n$ array $A$ of zeros and ones and a natural number $p$, our task is to partition $A$ into at most $p$ rectangular tiles, so that the maximal weight of…
We study orbifolds by permutations of two identical N=2 minimal models within the Gepner construction of four dimensional heterotic strings. This is done using the new N=2 supersymmetric permutation orbifold building blocks we have recently…