Related papers: Multi-dimensional Arrays with Levels

We classify primitive, rank 1, omega-categorical structures having polynomially many types over finite sets. For a fixed number of 4-types, we show that there are only finitely many such structures and that all are built out of finitely…

Despite significant advances in the field of deep learning in applications to various fields, explaining the inner processes of deep learning models remains an important and open question. The purpose of this article is to describe and…

Linear algebra computations are foundational for neural networks and machine learning, often handled through arrays. While many functional programming languages feature lists and recursion, arrays in linear algebra demand constant-time…

The structural analysis of shape boundaries leads to the characterization of objects as well as to the understanding of shape properties. The literature on graphs and networks have contributed to the structural characterization of shapes…

Shape graphs are complex geometrical structures commonly found in biological and anatomical systems. A shape graph is a collection of nodes, some connected by curvilinear edges with arbitrary shapes. Their high complexity stems from the…

A linear mapping upon real n-dimensional space, where the dimension n is odd, has a real eigenvalue-eigenvector pair. The corresponding statement for complex vector spaces holds true for any dimension n, but should be easy to demonstrate…

We define treetopes, a generalization of the three-dimensional roofless polyhedra (Halin graphs) to arbitrary dimensions. Like roofless polyhedra, treetopes have a designated base facet such that every face of dimension greater than one…

Hypergraphs provide a natural way to represent polyadic relationships in network data. For large hypergraphs, it is often difficult to visually detect structures within the data. Recently, a scalable polygon-based visualization approach was…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

This paper studies the "explanation problem" for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensional tree-ordered case. In this paper, one is given a matrix A whose…

The generalization of the geometric mean of positive scalars to positive definite matrices has attracted considerable attention since the seminal work of Ando. The paper generalizes this framework of matrix means by proposing the definition…

Let D = {D_{1},...,D_{l}} be an arrangement of smooth hypersurfaces with normal crossings on the complex projective space P^n and let \Omega^{1}_{P^n}(log D) be the logarithmic bundle attached to it. Following [1], we show that…

The ample hierarchy of geometries of stables theories is strict. We generalise the construction of the free pseudospace to higher dimensions and show that the n-dimensional free pseudospace is \omega-stable n-ample yet not (n+1)-ample. In…

A technical note aiming to offer deeper intuition for the LayerNorm function common in deep neural networks. LayerNorm is defined relative to a distinguished 'neural' basis, but it does more than just normalize the corresponding vector…

In this note we consider $k$-regular multigraphs, where the possible edge multiplicities are controlled. These structures are considered in a question recently posed by Brendan McKay. We express the generating functions using the scalar…

G-structures and Cartan geometries are two major approaches to the description of geometric structures (in the sense of differential geometry) on manifolds of some fixed dimension $n$. We show that both descriptions naturally extend to the…

We arrange the orders in an algebraic number field in a tree. This tree can be used to enumerate all orders of bounded index in the maximal order as well as the orders over some given order.

We study algebras k[x_1,...,x_n]/I which admit a grading by a subsemigroup of N^d such that every graded component is a one-dimensional k-vector space. V.I.~Arnold and coworkers proved that for d = 1 and n <= 3 there are only finitely many…

Modern analytical workloads increasingly combine relational data with array-valued attributes. While columnar database systems efficiently process such workloads, their ability to optimize queries that interleave relational operators with…

Combinatorial Hopf algebras of trees exemplify the connections between operads and bialgebras. Painted trees were introduced recently as examples of how graded Hopf operads can bequeath Hopf structures upon compositions of coalgebras. We…