Related papers: Frobenius templates in certain $2 \times 2$ matrix…

The problem of constructing a perfect cuboid is related to a certain class of univariate polynomials with three integer parameters $a$, $b$, and $u$. Their irreducibility over the ring of integers under certain restrictions for $a$, $b$,…

Classical primal-dual affine programming takes place over finite dimensional real vector spaces. This results in beautiful duality theory, connecting the optimal solu- tions of the primal maximization problem and the dual minimization…

The matrix representation of the set $\Delta({\bf d}^3)$, ${\bf d}^3=(d_1,d_2, d_3)$, of the integers which are unrepresentable by $d_1,d_2,d_3$ is found. The diagrammatic procedure of calculation of the generating function $\Phi({\bf…

The values of the homogeneous weight are determined for finite Frobenius rings that are a direct product of local Frobenius rings. This is used to investigate the partition induced by this weight and its dual partition under…

We construct a class of infinite-dimensional Frobenius manifolds on the space of pairs of certain even functions meromorphic inside or outside the unit circle. Via a bi-Hamiltonian recursion relation, the principal hierarchies associated to…

We compute the Frobenius number for numerical semigroups generated by the squares of three consecutive Fibonacci numbers. We achieve this by using and comparing three distinct algorithmic approaches: those developed by Ram\'irez Alfons\'in…

This paper provides a formula for the minimal relations and the Frobenius number of a numerical semigroup minimally generated by three pairwise coprime positive integers.

We consider codes defined over an affine algebra $\mathcal A=R[X_1,\dots,X_r]/\left\langle t_1(X_1),\dots,t_r(X_r)\right\rangle$, where $t_i(X_i)$ is a monic univariate polynomial over a finite commutative chain ring $R$. Namely, we study…

The main result of this paper is the decidability of the membership problem for $2\times 2$ nonsingular integer matrices. Namely, we will construct the first algorithm that for any nonsingular $2\times 2$ integer matrices $M_1,\dots,M_n$…

We address the inverse Frobenius--Perron problem: given a prescribed target distribution $\rho$, find a deterministic map $M$ such that iterations of $M$ tend to $\rho$ in distribution. We show that all solutions may be written in terms of…

In Secion~1 we describe what is known of the extent to which a separable extension of unital associative rings is a Frobenius extension. A problem of this kind is suggested by asking if three algebraic axioms for finite Jones index…

The Unbounded Subset Sum (USS) problem is an NP-hard computational problem where the goal is to decide whether there exist non-negative integers $x_1, \ldots, x_n$ such that $x_1 a_1 + \ldots + x_n a_n = b$, where $a_1 < \cdots < a_n < b$…

Two-dimensional constrained coding is a problem that is much more difficult than its one-dimensional counterpart. Indeed, in two dimensions, obtaining the answers to very natural questions becomes uncomputable. In particular, it is…

It has been understood that correlation functions of multi-trace operators in ${\cal N}=4$ SYM can be neatly computed using the group algebra of symmetric groups or walled Brauer algebras. On the other hand such algebras have been known to…

We continue the development of $\mathbb{Z}^n_2$-supergeometry, a natural generalization of classical ($\mathbb{Z}_2$-graded) supergeometry, by proving the Frobenius theorem for integrable distributions on differentiable…

We study the symmetric tensor rank of multiplication over finite field extensions using linearized polynomials. Via field trace, symmetric linearized polynomials are identified with symmetric bilinear forms and symmetric matrices, allowing…

In a previous paper we studied ``weakly primitive axial algebras'' with respect to more general fusion rules, for which at least one axis satisfies the fusion rules. In this continuation, a concise description is provided of the…

We present new bounds for the numerical radius of bounded linear operators and $2\times 2$ operator matrices. We apply upper bounds for the numerical radius to the Frobenius companion matrix of a complex monic polynomial to obtain new…

A composite number $n$ is called a Lehmer number when $\phi(n) | n - 1$, where $\phi$ is the Euler totient function. Lehmer's totient problem asks if there exist any composite numbers $n$ such that $\phi(n)| n-1$? No such numbers are known.…

Let $\mathbb{F}$ be a field, and $n \geq r>0$ be integers, with $r$ even. Denote by $\mathrm{A}_n(\mathbb{F})$ the space of all $n$-by-$n$ alternating matrices with entries in $\mathbb{F}$. We consider the problem of determining the…