Related papers: Scalar multiplication in compressed coordinates in…
As an attempt to bridge between numerical analysis and algebraic geometry, this paper formulates the multiplicity for the general nonlinear system at an isolated zero, presents an algorithm for computing the multiplicity structure, proposes…
We classify elliptic fibrations birational to a nonsingular, minimal cubic surface over a field of characteristic zero. Our proof is adapted to provide computational techniques for the analysis of such fibrations, and we describe an…
In this paper we introduce the notion of extension of a numerical semigroup. We provide a characterization of the numerical semigroups whose extensions are all arithmetic and we give an algorithm for the computation of the whole set of…
We establish relations between representation dimensions of two algebras connected by a Frobenius bimodule or extension. Consequently, upper bounds and equality formulas for representation dimensions of group algebras, symmetric separably…
We study trace codes with defining set $L,$ a subgroup of the multiplicative group of an extension of degree $m$ of the alphabet ring $\mathbb{F}_3+u\mathbb{F}_3+u^{2}\mathbb{F}_{3},$ with $u^{3}=1.$ These codes are abelian, and their…
In this paper we will give a global description of the Frobenius for the division fields of an elliptic curve E which is strictly analogous to the cyclotomic case. This is then applied to determine the splitting of a prime p in subfields of…
In this paper we completely describe the unital compressed commuting graph of the ring $\mathcal{M}_3(\mathrm{GF}(p))$ of $3 \times 3$ matrices over the finite prime field $\mathrm{GF}(p)$. To achieve this we combine methods from linear…
This paper continues a geometric study of Harvey's Complex of Curves, whose ultimate goal is to apply the theory of hyperbolic spaces and groups to algorithmic questions for the Mapping Class Group and geometric properties of Kleinian…
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 give the trace formulas of weight $k$ for cocompact, torsion-free discrete subgroups of $SU(2, 1)$ and prove the analogue of the Riemann hypothesis on compact complex surfaces $M$ with $c_1^2(M)=3 c_2(M)$, where $c_i(M)$ is the $i$-th…
We show how to construct highly symmetric algorithms for matrix multiplication. In particular, we consider algorithms which decompose the matrix multiplication tensor into a sum of rank-1 tensors, where the decomposition itself consists of…
The method of constructing spline classes in the form of trigonometric Fourier series whose coefficients have a certain decreasing order are considered. in turn, this decrement determines the number of continuous derivatives of sum of this…
Subtraction-free computational complexity is the version of arithmetic circuit complexity that allows only three operations: addition, multiplication, and division. We use cluster transformations to design efficient subtraction-free…
We prove several results on torsion points and Galois representations for complex multiplication (CM) elliptic curves over a number field containing the CM field. One result computes the degree in which such an elliptic curve has a rational…
We give an elementary proof of the Eilenberg-Mac Lane trace isomorphism between the third 2-abelian cohomology group and quadratic forms. Our approach yields explicit constructions and we characterize when quadratic forms can be expressed…
We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in $X$ and $Y$ are low with respect to their genera. The finite base fields $\FF_q$ are arbitrary, but their sizes…
For a prime $p$, we study subgroups of order p of the Brauer group Br(S) of a general complex polarized K3 surface of degree 2d, generalizing earlier work of van Geemen. These groups correspond to sublattices of index p of the…
We present a Mathematica package for doing computations with gamma matrices, spinors, tensors and other objects, in any dimension and signature. The approach we use is based on defining the commutation relations of the relevant matrices,…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
In this paper we introduce compressed commuting graph of rings. It can be seen as a compression of the standard commuting graph (with the central elements added) where we identify the vertices that generate the same subring. The compression…