相关论文: Hybrid approach to the joint spectral radius compu…

A representation of finite fields that has proved useful when implementing finite field arithmetic in hardware is based on an isomorphism between subrings and fields. In this paper, we present an unified formulation for multiplication in…

We prove a combinatorial version of Thom's Isotopy Lemma for projection maps applied to any complex or real toric variety. Our results are constructive and give rise to a method for associating the Whitney strata of the projection to the…

We describe recursive unique projection-aggregation (RUPA) decoding and iterative unique projection-aggregation (IUPA) decoding of Reed-Muller (RM) codes, which remove non-unique projections from the recursive projection-aggregation (RPA)…

The image quality of the new generation of earthbound Extremely Large Telescopes (ELTs) is heavily influenced by atmospheric turbulences. To compensate these optical distortions a technique called adaptive optics (AO) is used. Many AO…

In this paper we prove a tertiary index theorem which relates a spectral geometric and a homotopy theoretic invariant of an almost complex manifold with framed boundary. It is derived from the index theoretic and homotopy theoretic versions…

This study proposes the "adaptive flip graph algorithm", which combines adaptive searches with the flip graph algorithm for finding fast and efficient methods for matrix multiplication. The adaptive flip graph algorithm addresses the…

We propose a hybrid inertial self-adaptive algorithm for solving the split feasibility problem and fixed point problem in the class of demicontractive mappings. Our results are very general and extend several related results existing in…

We introduce new polynomial invariants of a finite-dimensional semisimple and cosemisimple Hopf algebra A over a field by using the braiding structures of A. We investigate basic properties of the polynomial invariants including stability…

In this paper we combine many of the standard and more recent algebraic techniques for testing isomorphism of finite groups (GpI) with combinatorial techniques that have typically been applied to Graph Isomorphism. In particular, we show…

Several problems in computer algebra can be efficiently solved by reducing them to calculations over finite fields. In this paper, we describe an algorithm for the reconstruction of multivariate polynomials and rational functions from their…

This paper considers the problem of distributed estimation in an incremental network when the measurements taken by the node follow a widely linear model. The proposed algorithm which we refer to it as incremental augmented affine…

Recently, considerable effort has been put into developing fast algorithms to reconstruct a rooted phylogenetic network that explains two rooted phylogenetic trees and has a minimum number of hybridization vertices. With the standard…

A special homotopy continuation method, as a combination of the polyhedral homotopy and the linear product homotopy, is proposed for computing all the isolated solutions to a special class of polynomial systems. The root number bound of…

We propose an extended method for experiment design in nonlinear state space models. The proposed input design technique optimizes a scalar cost function of the information matrix, by computing the optimal stationary probability mass…

In this paper we present a polynomial time algorithm to compute the local zeta function Z(s,f) attached to a polynomial f(x) in Z[x] (in one variable, with splitting field Q) and a prime p. The algorithm reduces in polynomial time the…

Polytopic matrix factorization (PMF) is a recently introduced matrix decomposition method in which the data vectors are modeled as linear transformations of samples from a polytope. The successful recovery of the original factors in the…

This paper develops and implements an algorithm to compute sequences of polytopic Robust Forward Invariant Sets (RFIS) that can parametrically vary in size between the maximal and minimal RFIS of a nonlinear dynamical system. This is done…

Two Hopf algebras are called monoidally Morita equivalent if module categories over them are equivalent as linear monoidal categories. We introduce monoidal Morita invariants for finite-dimensional Hopf algebras based on certain braid group…

A fast method for the computation of layer potentials that arise in acoustic scattering is introduced. The principal idea is to split the singular kernel into a smooth and a local part. The potential due to the smooth part is computed…

The reciprocal of the Ihara zeta function of a graph is a polynomial invariant introduced by Ihara in 1966. Scott and Storm gave a method to determine the coefficients of the polynomial. Here we simplify their calculation and determine the…