Related papers: Staircases in Z^2
Rank-width is a width parameter of graphs describing whether it is possible to decompose a graph into a tree-like structure by `simple' cuts. This survey aims to summarize known algorithmic and structural results on rank-width of graphs.
We study point-line configurations through the lens of projective geometry and matroid theory. Our focus is on their realisation spaces, where we introduce the concepts of liftable and quasi-liftable configurations, exploring cases in which…
The Bethe-Salpeter (BS) equation in the ladder approximation is studied within a scalar theory: two scalar fields (constituents) with mass $m$ interacting via an exchange of a scalar field (tieon) with mass $\mu$. The BS equation is written…
Given an $\alpha > 1$ and a $\theta$ with unbounded continued fraction entries, we characterise new relations between Sturmian subshifts with slope $\theta$ with respect to (i) an $\alpha$-H\"oder regularity condition of a spectral metric,…
In this paper, we study a classical construction of lattices from number fields and obtain a series of new results about their minimum distance and other characteristics by introducing a new measure of algebraic numbers. In particular, we…
In this paper we find an identity that gives a representation for the logarithm of any two irrational numbers $a, b >1$ in terms of a series whose terms are ratios of elements from the Beatty Sequences generated by these two numbers. We…
A rational projective plane ($\mathbb{QP}^2$) is a simply connected, smooth, closed manifold $M$ such that $H^*(M;\mathbb{Q}) \cong \mathbb{Q}[\alpha]/\langle \alpha^3 \rangle$. An open problem is to classify the dimensions at which such a…
For the rational, elliptic and trigonometric r-matrices, we exhibit the links between three "levels" of Poisson spaces: (a) Some finite-dimensional spaces of matrix-valued holomorphic functions on the complex line; (b) Spaces of spectral…
Treewidth is a graph parameter of fundamental importance to algorithmic and structural graph theory. This paper surveys several graph parameters tied to treewidth, including separation number, tangle number, well-linked number and Cartesian…
Graphs, and sequences of growing graphs, can be used to specify the architecture of mathematical models in many fields including machine learning and computational science. Here we define structured graph "lineages" (ordered by level…
In this paper we study the existence of higher dimensional arithmetic progression in Meyer sets. We show that the case when the ratios are linearly dependent over $\ZZ$ is trivial, and focus on arithmetic progressions for which the ratios…
Our main goal is to give a sense of recent developments in the (stable) rationality problem from the point of view of unramified cohomology and 0-cycles as well as derived categories and semiorthogonal decompositions, and how these…
We present a novel approach for data set scaling based on scale-measures from formal concept analysis, i.e., continuous maps between closure systems, and derive a canonical representation. Moreover, we prove said scale-measures are lattice…
We study a class of monic-palindromic polynomials that we call staircase palindromic polynomials. Specifically, suppose $S(x, n, h)$ is a polynomial of degree n with the special form: $S(x; n; h) = x^n + 2x^{n-1} + 3x^{n-2} + \dots + (h -…
A lattice is a set of all the integer linear combinations of certain linearly independent vectors. One of the most important concepts on lattice is the successive minima which is of vital importance from both theoretical and practical…
Quantum many-body systems with exact local gauge symmetries exhibit rich out-of-equilibrium physics such as constrained dynamics and disorder-free localization. In a joint submission [J. C. Halimeh and P. Hauke, arXiv:2004.07248], we…
Downarowicz and Maass (2008) proposed topological ranks for all homeomorphic Cantor minimal dynamical systems using properly ordered Bratteli diagrams. In this study, we adopt this definition to the case of all essentially minimal…
In Physics and in Mathematics $\mathbb{Z}_2^n$-gradings, $n \geq 2$, do appear quite frequently. The corresponding sign rules are determined by the `scalar product' of the involved $\mathbb{Z}_2^n$-degrees. The present paper is the first of…
A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance…
There is a contradiction at the heart of our current understanding of individual and collective mobility patterns. On one hand, a highly influential stream of literature on human mobility driven by analyses of massive empirical datasets…