Related papers: Simple proofs for lattice coverings and sparse ten…
We describe the basic lattice structures of attractors and repellers in dynamical systems. The structure of distributive lattices allows for an algebraic treatment of gradient-like dynamics in general dynamical systems, both invertible and…
The textbook proofs of Commoner's theorem characterizing liveness in free-choice Petri nets are given in contexts of technical notions and claims that make the proofs look a bit long. The aim of this note is to give a concise self-contained…
Matrices and more generally multidimensional arrays, form the backbone of computational studies. In this paper we demonstrate increases in computational efficiency by performing partial-tracing/tensor-contractions on sparse-arrays. It was…
In this paper we discuss copositive tensors, which are a natural generalization of the copositive matrices. We present an analysis of some basic properties of copositive tensors; as well as the conditions under which class of copositive…
This paper investigates the theory of lattices, focusing on extending lattices relative to abstract classes, modular lattices, and torsion lattices. Definitions of type-1 and type-2 extending lattices are provided, along with their weakly…
A given question can be defined in terms of the set of statements or assertions that answer it. Application of logical inference to these sets of assertions allows one to derive the logic of inquiry among questions. There are interesting…
Even though a lattice and its sublattices have the same group of coincidence isometries, the coincidence index of a coincidence isometry with respect to a lattice $\Lambda_1$ and to a sublattice $\Lambda_2$ may differ. Here, we examine the…
In this paper, we suggest a new method for a given tensor to find CP decompositions using a less number of rank $1$ tensors. The main ingredient is the Least Absolute Shrinkage and Selection Operator (LASSO) by considering the decomposition…
The orthogonal decomposition factorizes a tensor into a sum of an orthogonal list of rankone tensors. We present several properties of orthogonal rank. We find that a subtensor may have a larger orthogonal rank than the whole tensor and…
Sparse linear regression is a vast field and there are many different algorithms available to build models. Two new papers published in Statistical Science study the comparative performance of several sparse regression methodologies,…
Lattices and partially ordered sets have played an increasingly important role in coding theory, providing combinatorial frameworks for studying structural and algebraic properties of error-correcting codes. Motivated by recent works…
The notion of support provides an analogue of Stone duality, relating lattices to topological spaces. This note aims to explain in lattice theoretic terms what has been developed in the context of triangulated categories. In particular, the…
In this paper we prove a generalization of famous Larchr's theorem concerning good lattice points.
We introduce an inductive method for the study of the uniqueness of decompositions of tensors, by means of tensors of rank 1. The method is based on the geometric notion of weak defectivity. For three-dimensional tensors of type (a, b, c),…
We prove sharp bounds for the equivalence of norms in tent spaces with respect to changes of angles. Some applications are given.
We impose standard $ T1 $-type assumptions on a Calder\'on-Zygmund operator $ T $, and deduce that for bounded compactly supported functions $ f, g $ there is a sparse bilinear form $ \Lambda $ so that $$ \lvert \langle T f, g \rangle\rvert…
In this note, we present a simpler way to prove the compactness of the closed intervals in simply ordered set with order topology.
These short notes are meant as a quick reference for the construction of SLR(1), of LR(1), and of LALR(1) parsing tables.
In this paper, we focus on a special class of symmetric tensors, which can be orthogonally diagonalizable, and investigate their Z-eigenpairs problem. We show that the eigenpairs can be uniformly expressed using several basic eigenpairs,…
We give a simple example showing that a knot or link diagram that lies in the ${\mathbb{Z}}^2$ lattice is not necessarily the projection of a lattice stick knot or link in the ${\mathbb{Z}}^3$ lattice, and we give a necessary and sufficient…