English
Related papers

Related papers: On Sequences, Rational Functions and Decomposition

200 papers

Submodular functions describe a variety of discrete problems in machine learning, signal processing, and computer vision. However, minimizing submodular functions poses a number of algorithmic challenges. Recent work introduced an…

Optimization and Control · Mathematics 2014-11-06 Robert Nishihara , Stefanie Jegelka , Michael I. Jordan

We give explicit and asymptotic lower bounds for the quantity $|e^{s/t}-M/N|$ by studying a generalized continued fraction expansion of $e^{s/t}$. In cases $|s|\geq 3$ we improve existing results by extracting a large common factor from the…

Number Theory · Mathematics 2016-09-23 Kalle Leppälä , Tapani Matala-aho , Topi Törmä

We consider the problem of decomposing a regular non-negative function as a sum of squares of functions which preserve some form of regularity. In the same way as decomposing non-negative polynomials as sum of squares of polynomials allows…

Optimization and Control · Mathematics 2022-03-01 Ulysse Marteau-Ferey , Francis Bach , Alessandro Rudi

A notable feature of the TTE approach to computability is the representation of the argument values and the corresponding function values by means of infinitistic names. Two ways to eliminate the using of such names in certain cases are…

Logic in Computer Science · Computer Science 2015-07-01 Dimiter Skordev

We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested…

Logic in Computer Science · Computer Science 2010-04-13 Kai Brünnler

We study Poincar\'e series associated to a finite collection of divisors on i. a finite graph and ii. a certain family of metric graphs called chain of loops. Our main results are proofs of rationality of the Poincar\'e series and…

Combinatorics · Mathematics 2022-03-28 Madhusudan Manjunath

We give a survey on the theory of representation-finite and certain minimal representation-infinite algebras.The main goals are the existence of multiplicative bases and of coverings with good properties. Both are attained via…

Representation Theory · Mathematics 2013-02-06 Klaus Bongartz

Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. As to their relationship with respect…

Logic in Computer Science · Computer Science 2015-07-01 Friedrich Neurauter , Aart Middeldorp

Sequence models are a critical component of modern NLP systems, but their predictions are difficult to explain. We consider model explanations though rationales, subsets of context that can explain individual model predictions. We find…

Computation and Language · Computer Science 2021-11-19 Keyon Vafa , Yuntian Deng , David M. Blei , Alexander M. Rush

Generating functions for a fixed genus map and hypermap enumeration become rational after a simple explicit change of variables. Their numerators are polynomials with integer coefficients that obey a differential recursion, and denominators…

Combinatorics · Mathematics 2016-09-20 M. Kazarian , P. Zograf

In this paper, given a simple linear recurrence sequence of algebraic numbers, which has either a dominant characteristic root or exactly two characteristic roots of maximal modulus, we give some explicit lower bounds for the index beyond…

Number Theory · Mathematics 2018-10-03 Min Sha

The main purpose of this paper is to prove some density results of polynomials in Fock spaces of slice regular functions. The spaces can be of two different kinds since they are equipped with different inner products and contain different…

Complex Variables · Mathematics 2018-12-10 Kamal Diki , Sorin G. Gal , Irene Sabadini

We give some connections between various functions defined on finitely presented groups (isoperimetric, isodiametric, Todd-Coxeter radius, filling length functions, etc.), and we study the relation between those functions and the…

Group Theory · Mathematics 2007-05-23 Jean-Camille Birget

Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…

Symbolic Computation · Computer Science 2023-06-12 Alin Bostan , Pierre Lairez , Bruno Salvy

Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…

Logic · Mathematics 2024-03-21 Dag Normann , Sam Sanders

Let $p$ be an odd natural number $\ge 3$. Inspired by results from Euclid's {\em Elements}, we express the irrational $$y=\sqrt[p]{d+\sqrt R}, $$ whose degree is $2p$, as a polynomial function of irrationals of degrees $\le p$. In certain…

Number Theory · Mathematics 2020-04-14 Kurt Girstmair

This is an anthology of series involving rational, factorial, and power functions expressed in terms of special functions. New finite expansions involving quotient functions expressed in terms of the Hurwitz-Lerch zeta function are given.…

General Mathematics · Mathematics 2024-05-10 Robert Reynolds

We show that any lexsegment ideal with linear resolution has linear quotients with respect to a suitable ordering of its minimal monomial generators. For completely lexsegment ideals with linear resolution we show that the decomposition…

Commutative Algebra · Mathematics 2008-02-12 Viviana Ene , Anda Olteanu , Loredana Sorrenti

Let $r_1,\ldots,r_s:\mathbb{Z}_{n\geqslant 0}\to\mathbb{C}$ be linearly recurrent sequences whose associated eigenvalues have arguments in $\pi\mathbb{Q}$ and let $F(z):=\sum_{n\geqslant 0}f(n)z^n$, where $f(n)\in\{r_1(n),\ldots,$…

Number Theory · Mathematics 2017-09-05 Michael Coons

Using the notion of multivariate lower set interpolation, we construct nodal basis functions for the serendipity family of finite elements, of any order and any dimension. For the purpose of computation, we also show how to express these…

Numerical Analysis · Mathematics 2016-02-17 Michael S. Floater , Andrew Gillette