Related papers: The Ring of Algebraic Functions on Persistence Bar…
The present survey reports on the state of the art of the different cryptographic functionalities built upon the ring learning with errors problem and its interplay with several classical problems in algebraic number theory. The survey is…
We determine the structure of linear maps on the tensor product of matrices which preserve the numerical range or numerical radius.
In this paper, we introduce new classes of functions that extend the known classes of functions of complex variable, such as entire functions, meromorphic functions, rational functions and polynomial functions and take values in the set of…
Numerical experiments are performed in order to study the performance of ABS codes in solving non-linear systems of equations.
A class of spherical functions is studied which can be viewed as the matrix generalization of Bessel functions. We derive a recursive structure for these functions. We show that they are only special cases of more general radial functions…
In this note, we establish some new results on some special types of function algebras and also give new proofs to some existing ones
We show that on real algebraic sets algebraically constructible functions coincide with the finite sums of signs of polynomials. Then we give some applications.
We deal with equations over free semilattice of infinite rank and prove that any infinite consistent system of equations is equivalent to its finite subsystem. Moreover, we describe irreducible algebraic sets and solve some algorithmic…
In this paper, we explore the structure of the Hitchin map for higher dimensional varieties with emphasis on the case of algebraic surfaces.
Various problems on integers lead to the class of congruence preserving functions on rings, i.e. functions verifying $a-b$ divides $f(a)-f(b)$ for all $a,b$. We characterized these classes of functions in terms of sums of rational…
The branching data of an algebraic function is a list of orders of local monodromies around branching points. We present branching data that ensure that the algebraic functions having them are representable by radicals. This paper is a…
In this paper we briefly discuss \Rings --- an efficient lightweight library for commutative algebra. Polynomial arithmetic, GCDs, polynomial factorization and Gr\"obner bases are implemented with the use of modern asymptotically fast…
We give some experimental observations on the growth of the norm of certain matrices related to the Mertens function. The results obtained in these experiments convince us that linear algebra may help in the study of Mertens function and…
We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…
We develop the theory of patterns on numerical semigroups in terms of the admissibility degree. We prove that the Arf pattern induces every strongly admissible pattern, and determine all patterns equivalent to the Arf pattern. We study…
The aim of these notes is to study some of the structural aspects of the ring of arithmetical functions. We prove that this ring is neither Noetherian nor Artinian. Furthermore, we construct various types of prime ideals. We also give an…
We study stagnation zones of $\mathcal{A}$-harmonic functions on canonical domains in the Euclidean $n$-dimensional space. Phragmen-Lindel\"of type theorems are proved.
These informal notes are concerned with spaces of functions in various situations, including continuous functions on topological spaces, holomorphic functions of one or more complex variables, and so on.
Expanding upon recent work, a new class of $A$-functions is introduced that can be viewed as an appropriate generalization of the class of regular $A$-functions, the class of structured $A$-functions, and the class of perfect $A$-functions.…
This chapter introduces and elaborates on the fruitful interplay of coding theory and algebraic combinatorics, with most of the focus on the interaction of codes with combinatorial designs, finite geometries, simple groups, sphere packings,…