Related papers: Sequences involving square zig-zag shapes
In the present popular science paper we determine when a square can be dissected into rectangles similar to a given rectangle. The approach to the question is based on a physical interpretation using electrical networks. Only secondary…
The minimum semi-degree of a digraph D is the minimum of its minimum outdegree and its minimum indegree. We show that every sufficiently large digraph D with minimum semi-degree at least n/2 +k-1 is k-linked. The bound on the minimum…
In this paper, we define irregular interval-valued fuzzy graphs and their various classifications. Size of regular interval-valued fuzzy graphs is derived. The relation between highly and neighbourly irregular interval-valued fuzzy graphs…
This paper concerns the \textbf{abstract geometry of numbers}: namely the pursuit of certain aspects of geometry of numbers over a suitable class of normed domains. (The standard geometry of numbers is then viewed as geometry of numbers…
We consider triangulations of closed $2$-dimensional (not necessarily orientable) surfaces. Any minimal set of zigzags that double covers the set of edges provides a $z$-orientation of the triangulation. We introduce Markov chains of…
The generation of random graphs using edge swaps provides a reliable method to draw uniformly random samples of sets of graphs respecting some simple constraints, e.g. degree distributions. However, in general, it is not necessarily…
We investigate edge-intersection graphs of paths in the plane grid, regarding a parameter called the bend-number. I.e., every vertex is represented by a grid path and two vertices are adjacent if and only if the two grid paths share at…
For any row-finite graph $E$ and any field $K$ we construct the {\its Leavitt path algebra} $L(E)$ having coefficients in $K$. When $K$ is the field of complex numbers, then $L(E)$ is the algebraic analog of the Cuntz Krieger algebra…
We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…
We describe Hilbert's spacefilling curve in several different ways: as an automatic sequence of directions,as a regular and synchronized sequence of coordinates of lattice points encountered, and as an automatic bitmap image.
We introduce the chain geometry $\Sigma(K,R)$ over a ring $R$ with a distinguished subfield $K$, thus extending the usual concept where $R$ has to be an algebra over $K$. A chain is uniquely determined by three of its points, if, and only…
In this article we introduce a definition of k-uniform thresholds hypergraphs through a binary sequence, a natural extension of the classical definition for thresholds graphs. We characterize some of its eigenvalues and multiplicities by…
We give necessary and sufficient conditions for zigzag algebras and certain generalizations of them to be (relative) cellular, quasi-hereditary or Koszul.
Contrary to previous approaches bringing together algebraic geometry and signatures of paths, we introduce a Zariski topology on the space of paths itself, and study path varieties consisting of all paths whose iterated-integrals signature…
Although it is important both in theory as well as in applications, a theory of Birkhoff interpolation with main emphasis on the shape of the set of nodes is still missing. Although we will consider various shapes (e.g. we find all the…
A descent of a labeled acyclic digraph is a directed edge $x\to y$ with $x>y$. In this paper, we find a recurrence for the number of labeled acyclic digraphs with a given number of descents.
We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…
A permutation graph is a graph that can be derived from a permutation, where the vertices correspond to letters of the permutation, and the edges represent inversions. We provide a construction to show that there are infinitely many…
A new class of noncommutative $k$-algebras (for $k$ an algebraically closed field) is defined and shown to contain some important examples of quantum groups. To each such algebra, a first order theory is assigned describing models of a…
Given a natural number k and an orientable surface S of finite type, define the k-curve graph to be the graph with vertices corresponding to isotopy classes of essential simple closed curves on S and with edges corresponding to pairs of…