Related papers: Multi-dimensional Arrays with Levels
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
Orthogonal arrays play a fundamental role in many applications. However, constructing orthogonal arrays with the required parameters for an application usually is extremely difficult and, sometimes, even impossible. Hence there is an…
A three-tiered specification approach is developed to formally specify collections of collaborating objects, say micro-architectures. (i) The structural properties to be maintained in the collaboration are specified in the lowest tier. (ii)…
A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…
A square matrix $M$ represents a graph $\Gamma$ if its nonzero off-diagonal entries encode the adjacencies of $\Gamma$, subject to a fixed ordering of the vertices. Over the field of two elements, we investigate the distribution of ranks in…
We introduce the notion of rank of multivector in Clifford geometric algebras of arbitrary dimension without using the corresponding matrix representations and using only geometric algebra operations. We use the concepts of characteristic…
For any increasing function $f: {\Bbb N} \rightarrow {\Bbb N}_{\ge 2}$ which takes only finitely many distinct values, a connected finite dimensional algebra $\Lambda$ is constructed, with the property that $\text{fin.dim}_n\, \Lambda =…
A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…
A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge…
The Mapper algorithm, a technique within topological data analysis (TDA), constructs a simplified graphical representation of high-dimensional data to uncover its underlying shape and structural patterns. The algorithm has attracted…
We study Jordan types of linear forms for graded Artinian Gorenstein algebras having arbitrary codimension. We introduce rank matrices of linear forms for such algebras that represent the ranks of multiplication maps in various degrees. We…
In this paper, we propose a general framework that extends the theory of permutation patterns to higher dimensions and unifies several combinatorial objects studied in the literature. Our approach involves introducing the concept of a…
A mode of a multiset $S$ is an element $a \in S$ of maximum multiplicity; that is, $a$ occurs at least as frequently as any other element in $S$. Given a list $A[1:n]$ of $n$ items, we consider the problem of constructing a data structure…
Given a 3D surface defined by an elevation function on a 2D grid as well as non-spatial features observed at each pixel, the problem of surface segmentation aims to classify pixels into contiguous classes based on both non-spatial features…
Amorphous ice phases are key constituents of water's complex structural landscape. This study investigates the polyamorphic nature of water, focusing on the complexities within low-density amorphous ice (LDA), high-density amorphous ice…
Topological data analysis (TDA), while abstract, allows a characterization of time-series data obtained from nonlinear and complex dynamical systems. Though it is surprising that such an abstract measure of structure - counting pieces and…
Let $\Lambda$ be a basic finite dimensional algebra over an algebraically closed field, presented as a path algebra modulo relations; further, assume that $\Lambda$ is graded by lengths of paths. The paper addresses the classifiability, via…
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…
Ordered set (and map) is one of the most used data type. In addition to standard set operations, like insert, delete and contains, it can provide set-set operations such as union, intersection, and difference. Each of these set-set…
In this paper we define a new class of partially filled arrays, called $\lambda$-fold relative Heffter arrays, that are a generalisation of the Heffter arrays introduced by Archdeacon in 2015. After showing the connection of this new…