Searcharxiv⌕ Search

arXiv subjects

Edinah K. Gnang

Publications and source records attributed to Edinah K. Gnang.

29 records · Page 2Linked to original sources
arXiv2014

Computing Spectral Elimination Ideals

We present here an overview of the hypermatrix spectral decomposition deduced from the Bhattacharya-Mesner hypermatrix algebra. We describe necessary and sufficient conditions for the existence of a spectral decomposition. We further extend to hypermatrices the notion of resolution of identity and use them to derive hypermatrix analog of matrix spectral bounds. Finally we describe an algorithm for computing generators of the spectral elimination ideals which considerably improves on Groebner basis computation suggested in.

math.AC↗
arXiv2014

Computational Aspects of the Combinatorial Nullstellensatz Method

We discuss here some computational aspects of the Combinatorial Nullstellensatz argument. Our main result shows that the order of magnitude of the symmetry group associated with permutations of the variables in algebraic constraints, determines the performance of algorithms naturally deduced from Alon's Combinatorial Nullstellensatz arguments. Finally we present a primal-dual polynomial constructions for certifying the existence or the non-existence of solutions to combinatorial problems.

math.CO↗
arXiv2013

Zeroless Arithmetic: Representing Integers ONLY using ONE

We use recurrence equations (alias difference equations) to enumerate the number of formula-representations of positive integers using only addition and multiplication, and using addition, multiplication, and exponentiation, where all the inputs are ones. We also describe efficient algorithms for the random generation of such representations, and use Dynamical Programming to find a shortest possible formula representing any given positive integer.

math.CO↗
arXiv2013

Some integer formula-encodings and related algorithms

We investigate the special class of formulas made up of arbitrary but finite com- binations of addition, multiplication, and exponentiation gates. The inputs to these formulas are restricted to the integral unit 1. In connection with such formulas, we describe two essen- tially distinct families of canonical formula-encodings for integers, respectively deduced from the decimal encoding and the fundamental theorem of arithmetic. Our main contribution is the de- tailed description of two algorithms which efficiently determine the canonical formula-encodings associated with relatively large sets of consecutive integers.

math.CO↗
arXiv2012

The devil is in Asymmetries (Rough Version)

We formally investigate some computational obstacles to tractability of computing the variety determined by K complex polynomials in N boolean variables. We show that using algebraic methods for solving combinatorial problems, the obstacles to tractability lies in the order of magnitude of asymmetries admitted by the given system of equations.

math.AG↗
arXiv2012

Special bases for the vector space of square matrices

We describe families of complete orthogonal bases of full rank matrices which span the vector spaces of square matrices. The proposed bases generalise non-trivially the Pauli matrice while shedding light on their algebraic properties. Finally we introduce the notion k -pseudo-closure for orthogonal bases spanning vector subspaces of square matrices and discuss their connections with hadamard matrices.

math.RA↗
arXiv2012

Combinatorial Constructions for Sifting Primes and Enumerating the Rationals

We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that such mappings achieve much more than enumeration of rooted trees. We discuss two related structural bijections. The first corresponds to a bijective map between integers and rooted trees. The first bijection also suggests a new algorithm for sifting primes. The second bijection extends the first one in order to map rational numbers to a family of rooted trees. The second bijection suggests a new combinatorial construction for generating reduced rational numbers, thereby producing refinements of the output of the Wilf-Calkin[1] Algorithm.

math.CO↗
arXiv2011

A Spectral Theory for Tensors

In this paper we propose a general spectral theory for tensors. Our proposed factorization decomposes a tensor into a product of orthogonal and scaling tensors. At the same time, our factorization yields an expansion of a tensor as a summation of outer products of lower order tensors . Our proposed factorization shows the relationship between the eigen-objects and the generalised characteristic polynomials. Our framework is based on a consistent multilinear algebra which explains how to generalise the notion of matrix hermicity, matrix transpose, and most importantly the notion of orthogonality. Our proposed factorization for a tensor in terms of lower order tensors can be recursively applied so as to naturally induces a spectral hierarchy for tensors.

math.SP↗
arXiv2011

Experimental Number Theory, Part I : Tower Arithmetic

We introduce in this section an Algebraic and Combinatorial approach to the theory of Numbers. The approach rests on the observation that numbers can be identified with familiar combinatorial objects namely rooted trees, which we shall here refer to as towers. The bijection between numbers and towers provides some insights into unexpected connexions between Number theory, combinatorics and discrete probability theory.

math.NT↗