English
Related papers

Related papers: On Sequences, Rational Functions and Decomposition

200 papers

In this paper we introduce a family of rational approximations of the reciprocal of a $\phi$-function involved in the explicit solutions of certain linear differential equations, as well as in integration schemes evolving on manifolds. The…

Numerical Analysis · Mathematics 2021-05-18 Paola Boito , Yuli Eidelman , Luca Gemignani

Functional graphs (FGs) model the graph structures used to analyse the behaviour of functions from a discrete set to itself. In turn, such functions are used to study real complex phenomena evolving in time. As the systems involved can be…

Dynamical Systems · Mathematics 2024-04-05 François Doré , Enrico Formenti , Antonio E. Porreca , Sara Riva

We study a certain class of arithmetic functions that appeared in Klurman's classification of $\pm 1$ multiplicative functions with bounded partial sums, c.f., Comp. Math. 153 (8), 2017, pp. 1622-1657. These functions are periodic and…

Number Theory · Mathematics 2026-01-14 Marco Aymone , Gopal Maiti , Olivier Ramaré , Priyamvad Srivastav

A set $R\subset \mathbb{N}$ is called rational if it is well-approximable by finite unions of arithmetic progressions. Examples of rational sets include many classical sets of number-theoretical origin such as the set of squarefree numbers,…

Dynamical Systems · Mathematics 2022-05-16 Vitaly Bergelson , Joanna Kułaga-Przymus , Mariusz Lemańczyk , Florian K. Richter

We consider linear systems of recurrence equations whose coefficients are given in terms of indefinite nested sums and products covering, e.g., the harmonic numbers, hypergeometric products, $q$-hypergeometric products or their mixed…

Symbolic Computation · Computer Science 2017-05-02 Johannes Middeke , Carsten Schneider

By means of partial fraction method, we investigate the decomposition of rational functions. Several striking identities on harmonic numbers and generalized Apery numbers will be established, including the binomial-harmonic number identity…

Combinatorics · Mathematics 2007-05-23 Wenchang Chu

A finite semifield is a division algebra over a finite field where multiplication is not necessarily associative. We consider here the complexity of the multiplication in small semifields and finite field extensions. For this operation, the…

Symbolic Computation · Computer Science 2026-02-11 Jean-Guillaume Dumas , Stefano Lia , John Sheekey

The goal of this paper consists of developing a new (more physical and numerical in comparison with standard and non-standard analysis approaches) point of view on Calculus with functions assuming infinite and infinitesimal values. It uses…

General Mathematics · Mathematics 2012-03-20 Yaroslav D. Sergeyev

Starting from Ritt's classical theorems, we give a survey of results in functional decomposition of polynomials and of applications in Diophantine equations. This includes sufficient conditions for the indecomposability of polynomials, the…

Number Theory · Mathematics 2015-03-19 Dijana Kreso , Robert F. Tichy

In this self-contained paper, we present a theory of the piecewise linear minimal valid functions for the 1-row Gomory-Johnson infinite group problem. The non-extreme minimal valid functions are those that admit effective perturbations. We…

Optimization and Control · Mathematics 2022-09-08 Robert Hildebrand , Matthias Köppe , Yuan Zhou

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

Optimization and Control · Mathematics 2023-10-02 Levent Tunçel , Stephen A. Vavasis , Jingye Xu

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

Computational Complexity · Computer Science 2016-08-15 Peter Franek , Stefan Ratschan , Piotr Zgliczynski

Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…

Machine Learning · Computer Science 2019-10-23 Roozbeh Farhoodi , Khashayar Filom , Ilenna Simone Jones , Konrad Paul Kording

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

Computational Complexity · Computer Science 2014-08-19 Robert L. Surowka , Kenneth W. Regan

We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…

Algebraic Geometry · Mathematics 2009-10-16 Arnaud Bodin

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

Logic in Computer Science · Computer Science 2023-06-22 Arnon Avron , Liron Cohen

This expository essay discusses a finite dimensional approach to dilation theory. How much of dilation theory can be worked out within the realm of linear algebra? It turns out that some interesting and simple results can be obtained. These…

Functional Analysis · Mathematics 2014-12-23 Eliahu Levy , Orr Shalit

A rational function is the ratio of two complex polynomials in one variable without common roots. Its degree is the maximum of the degrees of the numerator and the denominator. Rational functions belong to the same class if one turns into…

Quantum Algebra · Mathematics 2007-05-23 I. Scherbak

In this paper, we extend the work of Abbondati et al. (2024) on decoding simultaneous rational function codes by addressing two important scenarios: multiplicities and poles (zeros of denominators). First, we generalize previous results to…

Information Theory · Computer Science 2025-08-08 Matteo Abbondati , Eleonora Guerrini , Romain Lebreton

Fair termination is the property of programs that may diverge "in principle" but that terminate "in practice", i.e. under suitable fairness assumptions concerning the resolution of non-deterministic choices. We study a conservative…

Logic in Computer Science · Computer Science 2022-07-11 Luca Ciccone , Luca Padovani
‹ Prev 1 4 5 6 7 8 10 Next ›