Related papers: Improved algorithms for splitting full matrix alge…
The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…
We study the differential identities of the algebra $M_k(F)$ of $k\times k$ matrices over a field $F$ of characteristic zero when its full Lie algebra of derivations, $L=\mbox{Der}(M_k(F))$, acts on it. We determine a set of 2 generators of…
We consider algebras of $m\times m\times m$-cubic matrices (with $m=1,2,\dots$). Since there are several kinds of multiplications of cubic matrices, one has to specify a multiplication first and then define an algebra of cubic matrices…
We consider the algebraic K-theory of a truncated polynomial algebra in several commuting variables, K(k[x_1, ..., x_n]/(x_1^a_1, ..., x_n^a_n)). This naturally leads to a new generalization of the big Witt vectors. If k is a perfect field…
In this paper, we present a new exact algorithm for counting perfect matchings, which relies on neither inclusion-exclusion principle nor tree-decompositions. For any bipartite graph of $2n$ nodes and $\Delta n$ edges such that $\Delta \geq…
The Fast Fourier Transform (FFT) over a finite field $\mathbb{F}_q$ computes evaluations of a given polynomial of degree less than $n$ at a specifically chosen set of $n$ distinct evaluation points in $\mathbb{F}_q$. If $q$ or $q-1$ is a…
The degree splitting problem requires coloring the edges of a graph red or blue such that each node has almost the same number of edges in each color, up to a small additive discrepancy. The directed variant of the problem requires…
We study the partially asymmetric exclusion process with open boundaries. We generalise the matrix approach previously used to solve the special case of total asymmetry and derive exact expressions for the partition sum and currents valid…
Linear systems with a tensor product structure arise naturally when considering the discretization of Laplace type differential equations or, more generally, multidimensional operators with separable coefficients. In this work, we focus on…
Let $R=\oplus_{\Gamma\in\Gamma}R_{\gamma}$ be a $\Gamma$-graded $K$-algebra over a field $K$, where $\Gamma$ is a totally ordered semigroup, and let $I$ be an ideal of $R$. Considering the $\Gamma$-grading filtration $FR$ of $R$ and the…
In previous research, quantum resources were concretely estimated for solving Elliptic Curve Discrete Logarithm Problem(ECDLP). In [1], the quantum algorithm was optimized for the binary elliptic curves and the main optimization target was…
Matrix properties are a type of property of categories which includes the ones of being Mal'tsev, arithmetical, majority, unital, strongly unital and subtractive. Recently, an algorithm has been developed to determine implications…
In this note we are dealing with a particular class of quadratic algebras -- the so-called quantum matrix algebras. The well-known examples are the algebras of quantized functions on classical Lie groups (the RTT algebras). We consider the…
We extend coded distributed computing over finite fields to allow the number of workers to be larger than the field size. We give codes that work for fully general matrix multiplication and show that in this case we serendipitously have…
Let $A$ be an $N\times N$ irreducible matrix with entries in $\{0,1\}$. We present an easy way to find an $(N+3)\times (N+3)$ irreducible matrix $\bar{A}$ with entries in $\{0,1\}$ such that their Cuntz--Krieger algebras ${\mathcal{O}}_A$…
We study the relationship between two key concepts in the theory of (di)graphs: the quotient digraph, and the lift $\Gamma^{\alpha}$ of a base (voltage) digraph. These techniques contract or expand a given digraph in order to study its…
We present in this paper two different classes of general $K$-splitting algorithms for solving finite-dimensional convex optimization problems. Under the assumption that the function being minimized has a Lipschitz continuous gradient, we…
The idea of embedding optimization problems into deep neural networks as optimization layers to encode constraints and inductive priors has taken hold in recent years. Most existing methods focus on implicitly differentiating…
Given an Artinian algebra $A$ over a field $k$, there are several combinatorial objects associated to $A$. They are the diagram $D_A$ as defined in [DK], the natural quiver $\Delta_A$ defined in \cite{Li} (cf. Section 2), and a generalized…
This paper presents a computationally efficient decoder for multiple antenna systems. The proposed algorithm can be used for any constellation (QAM or PSK) and any labeling method. The decoder is based on matrix-lifting Semi-Definite…