Related papers: Vector Partition Identities for $2$D, $3$D and $n$…

Decision trees are popular machine learning models that are simple to build and easy to interpret. Even though algorithms to learn decision trees date back to almost 50 years, key properties affecting their generalization error are still…

We study geometric aspects of horizontal 2-plane distributions on the complement of the zero section in the 5-dimensional total space of a rank-3 vector bundle equipped with connection over a surface. We show that any surface in…

We present two methods to continuously and piecewise-linearly parametrize rank-3 lattices by vectors of $\RR^{13}$, which provides an efficient way to judge if two sets of parameters provide nearly identical lattices within their margins of…

In 2008, L\'aszl\'o Z\'adori proved that the lattice Sub$(V)$ of all subspaces of a vector space $V$ of finite dimension at least 3 over a finite field $F$ has a 5-element generating set; in other words, Sub$(V)$ is 5-generated. We prove…

Shape priors have long been known to be effective when reconstructing 3D shapes from noisy or incomplete data. When using a deep-learning based shape representation, this often involves learning a latent representation, which can be either…

Realistic 3D-conformations of protein structures can be embedded in a cubic lattice using exclusively integer numbers, additions, subtractions and boolean operations.

In many areas of applied geometric/numeric computational mathematics, including geo-mapping, computer vision, computer graphics, finite element analysis, medical imaging, geometric design, and solid modeling, one has to compute incidences,…

We show how the existence of various free vector lattices and free vector lattice algebras can be derived from a theorem on equational classes in universal algebra. A discussion about free $f$-algebras over non-empty sets is given, where…

We show that a proper algebraic n-dimensional scheme Y admits nontrivial vector bundles of rank n, even if Y is non-projective, provided that there is a modification containing a projective Cartier divisor that intersects the exceptional…

The notion of multidimensional quadrilateral lattice is introduced. It is shown that such a lattice is characterized by a system of integrable discrete nonlinear equations. Different useful formulations of the system are given. The…

We find tight estimates for the minimum number of proper subspaces needed to cover all lattice points in an n-dimensional convex body symmetric about the origin. We also find the order of magnitude of the number of (n-1)-dimensional…

We study the multiplication operation of square matrices over lattices. If the underlying lattice is distributive, then matrices form a semigroup; we investigate idempotent and nilpotent elements and the maximal subgroups of this matrix…

We address a linearity problem for differentiable vectors in representations of infinite-dimensional Lie groups on locally convex spaces, which is similar to the linearity problem for the directional derivatives of functions.

The impressive results of modern neural networks partly come from their non linear behaviour. Unfortunately, this property makes it very difficult to apply formal verification tools, even if we restrict ourselves to networks with a…

We develop a Van der Waerden type theorem in an axiomatic setting of graded lattices and show that this axiomatic formulation can be applied to various lattices, for instance the set partition and the Boolean lattices. We derive the…

We classify the Boolean degree $1$ functions of $k$-spaces in a vector space of dimension $n$ (also known as Cameron-Liebler classes) over the field with $q$ elements for $n \geq n_0(k, q)$. This also implies that two-intersecting sets with…

We propose a neural embedding algorithm called Network Vector, which learns distributed representations of nodes and the entire networks simultaneously. By embedding networks in a low-dimensional space, the algorithm allows us to compare…

We define and study a certain category of vector bundles on a p-adic curve to which we can associate in a functorial way finite dimensional p-adic representations of the geometric fundamental group. Among other things we investigate two…

In this paper, vector ultrametric spaces are introduced and a fixed point theorem is given for correspondences. Our main result generalizes a known theorem in ordinary ultrametric spaces.

We present algorithms for classification of linear codes over finite fields, based on canonical augmentation and on lattice point enumeration. We apply these algorithms to obtain classification results over fields with 2, 3 and 4 elements.…