Related papers: Linear Network Coding over Rings, Part II: Vector …
Network coding theory studies the transmission of information in networks whose vertices may perform nontrivial encoding and decoding operations on data as it passes through the network. The main approach to deciding the feasibility of…
Let $\Lambda$ be a commutative Noetherian ring, and let $I$ be a proper ideal of $\Lambda$, $R=\Lambda /I$. Consider the polynomial rings $T=\Lambda [x_1,...x_n]$ and $A=R[x_1,...,x_n]$. Suppose that linear equations are solvable in…
The reliability of a network is an important parameter to consider when building a network. Different characteristics of the network can become unreliable over time or from other outside forces. In a simple setting, we model a network as a…
In this paper we investigate formal verification problems for Neural Network computations. Of central importance will be various robustness and minimization problems such as: Given symbolic specifications of allowed inputs and outputs in…
Linear codes are widely studied in coding theory as they have nice applications in distributed storage, combinatorics, lattices, cryptography and so on. Constructing linear codes with desirable properties is an interesting research topic.…
The paper is devoted to studying the orthogonality graph of the matrix ring over a commutative ring. It is proved that the orthogonality graph of the ring of matrices with size greater than 1 over a commutative ring with zero-divisors is…
Flexible network design deals with building a network that guarantees some connectivity requirements between its vertices, even when some of its elements (like vertices or edges) fail. In particular, the set of edges (resp. vertices) of a…
Discrete polymatroids are the multi-set analogue of matroids. In this paper, we explore the connections among linear network coding, linear index coding and representable discrete polymatroids. We consider vector linear solutions of…
In the computation of the normal form of a colored network vector field, following the semigroup(oid) approach in [19], one would like to be able to say something about the structure of the Lie algebra of linear colored network vector…
Over an algebraically closed field, we describe the affine varieties of solutions to the linear equations $a(xb)=c$ and $a(bx)=c$ over the split-octonions. We also determine the dimensions of the solution sets of arbitrary linear monomial…
This article concerns linear parts of minimal resolutions of finitely generated modules over commutative local, or graded rings. The focus is on the linearity defect of a module, which marks the point after which the linear part of its…
Neural networks typically exhibit permutation symmetries which contribute to the non-convexity of the networks' loss landscapes, since linearly interpolating between two permuted versions of a trained network tends to encounter a high loss…
We characterize the resolvability region for a large class of point-to-point channels with continuous alphabets. In our direct result, we prove not only the existence of good resolvability codebooks, but adapt an approach based on the…
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…
In this paper we describe an approach to construct large extendable collections of vectors in predefined spaces of given dimensions. These collections are useful for neural network latent space configuration and training. For classification…
In the last 60 years coding theory has been studied a lot over finite fields $\mathbb{F}_q$ or commutative rings $\mathcal{R}$ with unity. Although in $1993$, a study on the classification of the rings (not necessarily commutative or ring…
Let $V$ be a finite vector space over a finite field of order $q$ and of characteristic $p$. Let $G\leq GL(V)$ be a $p$-solvable completely reducible linear group. Then there exists a base for $G$ on $V$ of size at most $2$ unless $q \leq…
We set up some basic module theory over semirings, with particular attention to what is needed in scheme theory over semirings. We show that while not all the usual definitions of vector bundle agree over semirings, all the usual…
Given an admissible map F for a homogeneous network N, it is known that the Jacobian DF(x) around a fully synchronous point x = (x0, ..., x0) is again an admissible map for N. Motivated by this, we study the spectra of linear admissible…
An important issue in neural network research is how to choose the number of nodes and layers such as to solve a classification problem. We provide new intuitions based on earlier results by An et al. (2015) by deriving an upper bound on…