Related papers: On Achievability of an $(r,l)$ Fractional Linear N…

This paper considers vector network coding solutions based on rank-metric codes and subspace codes. The main result of this paper is that vector solutions can significantly reduce the required alphabet size compared to the optimal scalar…

We study equations in groups G with unique m-th roots for each positive integer m. A word equation in two letters is an expression of the form w(X,A) = B, where w is a finite word in the alphabet {X,A}. We think of A,B in G as fixed…

Message passing neural networks (MPNNs) have emerged as the most popular framework of graph neural networks (GNNs) in recent years. However, their expressive power is limited by the 1-dimensional Weisfeiler-Lehman (1-WL) test. Some works…

Neural networks are famously nonlinear. However, linearity is defined relative to a pair of vector spaces, $f:X \to Y$. Leveraging the algebraic concept of transport of structure, we propose a method to explicitly identify non-standard…

This note provides a family of classification problems, indexed by a positive integer $k$, where all shallow networks with fewer than exponentially (in $k$) many nodes exhibit error at least $1/6$, whereas a deep network with 2 nodes in…

In 2008, M. Marshall settled a long-standing open problem by showing that if f(x,y) is a polynomial that is non-negative on the strip [0,1] x R, then there exist sums of squares s(x,y) and t(x,y) such that f(x,y) = s(x,y) + (x - x^2)…

Boolean cardinality constraints state that at most (at least, or exactly) $k$ out of $n$ propositional literals can be true. We propose a new class of selection networks that can be used for an efficient encoding of them. Several comparator…

Let us fix a prime $p$ and a homogeneous system of $m$ linear equations $a_{j,1}x_1+\dots+a_{j,k}x_k=0$ for $j=1,\dots,m$ with coefficients $a_{j,i}\in\mathbb{F}_p$. Suppose that $k\geq 3m$, that $a_{j,1}+\dots+a_{j,k}=0$ for $j=1,\dots,m$…

We study scalar-linear and vector-linear solutions of the generalized combination network. We derive new upper and lower bounds on the maximum number of nodes in the middle layer, depending on the network parameters and the alphabet size.…

Let $p$ be an odd prime number. We prove that for $m\equiv1\mod p$, $x^m$ is perfectly nonlinear over $\mathbb{F}_{p^n}$ for infinitely many $n$ if and only if $m$ is of the form $p^l+1$, $l\in\mathbb{N}$. First, we study singularities of…

A completion of an m-by-n matrix A with entries in {0,1,*} is obtained by setting all *-entries to constants 0 or 1. A system of semi-linear equations over GF(2) has the form Mx=f(x), where M is a completion of A and f:{0,1}^n --> {0,1}^m…

The decision problems on matrices were intensively studied for many decades as matrix products play an essential role in the representation of various computational processes. However, many computational problems for matrix semigroups are…

The purpose of this paper is to investigate the non-constant entire as well as meromorphic solutions of the Fermat-type partial differential-difference equation: \[\left(\sum_{j=1}^m\frac{\partial f(z_1, z_2, \ldots, z_m)}{\partial…

We propose a new class of mathematical structures called (m,n)-semirings} (which generalize the usual semirings), and describe their basic properties. We also define partial ordering, and generalize the concepts of congruence, homomorphism,…

Chains with long-range interactions are considered. The interactions are defined such that each nth particle interacts only with chain particles with the numbers n+a(m) and n-a(m), where m=1,2,3,... and a(m) is an integer-valued function.…

An integer linear system is a set of inequalities with integer constraints. The solution graph of an integer linear system is an undirected graph defined on the set of feasible solutions to the integer linear system. In this graph, a pair…

We consider a class of semilinear elliptic system of the form $-\Delta u(x,y)+\nabla W(u(x,y))=0,\quad (x,y)\in\R^{2}$ where $W:\R^{2}\to\R$ is a double well non negative symmetric potential. We show, via variational methods, that if the…

A weak formulation is devised for the K(m,n) equation which is a nonlinearly dispersive generalization of the gKdV equation having compacton solutions. With this formulation, explicit weak compacton solutions are derived, including ones…

Let $m$ be a positive integer larger than $1$, let $w$ be a finite word over $\left\{0,1,...,m-1\right\}$ and let $a_{m;w}(n)$ be the number of occurrences of the word $w$ in the $m$-expansion of $n$ mod $p$ for any non-negative integer…

We consider a large class of matrix problems, which includes the problem of classifying arbitrary systems of linear mappings. For every matrix problem from this class, we construct Belitskii's algorithm for reducing a matrix to a canonical…