相关论文: Near orders and codes
The purpose of this paper is twofold. First, basic concepts such as Gamma function, almost convergence, fractional order difference operator and sequence spaces are given as a survey character. Thus, the current knowledge about those…
Generic approximation of entire functions by their Pad\'{e} approximants has been achieved in the past (\cite{3}). In the present article we obtain generic approximation of holomorphic functions on arbitrary open sets by sequences of their…
In this paper we compute the order (or Feng-Rao) bound on the minimum distance of one-point algebraic geometry codes, when the Weierstrass semigroup at the point Q is an Arf semigroup. The results developed to that purpose also provide the…
Higher-order probabilistic programming languages allow programmers to write sophisticated models in machine learning and statistics in a succinct and structured way, but step outside the standard measure-theoretic formalization of…
In this paper we develop homotopy theoretical methods for studying diagrams. In particular we explain how to construct homotopy colimits and limits in an arbitrary model category. The key concept we introduce is that of a model…
Horn functions form a subclass of Boolean functions and appear in many different areas of computer science and mathematics as a general tool to describe implications and dependencies. Finding minimum sized representations for such functions…
We present an application of Hilbert quasi-polynomials to order domains, allowing the effective check of the second order-domain condition in a direct way. We also provide an improved algorithm for the computation of the related Hilbert…
Expository paper discussing AG or Goppa codes arising from curves, first from an abstract general perspective then turning to concrete examples associated to modular curves. We will try to explain these extremely technical ideas using a…
For every natural number k we prove a decomposition theorem for bounded measurable functions on compact abelian groups into a structured part, a quasi random part and a small error term. In this theorem quasi randomness is measured with the…
Exponential integrators based on contour integral representations lead to powerful numerical solvers for a variety of ODEs, PDEs, and other time-evolution equations. They are embarrassingly parallelizable and lead to global-in-time…
We strengthen the classical approximation theorems of Weierstrass, Runge and Mergelyan by showing the polynomial and rational approximants can be taken to have a simple geometric structure. In particular, when approximating a function $f$…
The simple interpretation of the minimum distance of a linear code obtained by De Boer and Pellikaan, and later refined by the second author, is further developed through the study of various finitely generated graded modules. We use the…
In this article, we present a new construction of codes from algebraic curves. Given a curve over a non-prime finite field, the obtained codes are defined over a subfield. We call them Cartier Codes since their construction involves the…
We define H{\"o}lder classes in the $L^p$ norm on a chord-arc curve in $\mathbb{R}^3$ and prove direct and inverse approximation theorems for functions from these classes by functions harmonic in a neighborhood of the curve. The…
This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…
Through the subsequent discussion we consider a certain particular sort of (topological) algebras, which may substitute the `` structure sheaf algebras'' in many--in point of fact, in all--the situations of a geometrical character that…
The notion of a KU-valued function on a set is introduced and related properties are investigated. Codes generated by KU-valued functions are established. Moreover, we will provide an algorithm which allows us to find a KU-algebra starting…
Whenever the defining sequence of a Carleman ultraholomorphic class (in the sense of H. Komatsu) is strongly regular and associated with a proximate order, flat functions are constructed in the class on sectors of optimal opening. As…
Recently, Chach\'olski, Neeman, Pitsch, and Scherer studied, in a series of three papers, model approximations for the unbounded category of cochain complexes over a commutative ring. These approximations allow to construct relative…
We present an introduction to the theory of algebraic geometry codes. Starting from evaluation codes and codes from order and weight functions, special attention is given to one-point codes and, in particular, to the family of Castle codes.