English
Related papers

Related papers: D-algebraic Guessing

200 papers

In an automatic search, we found conjectural recurrences for some sequences in the OEIS that were not previously recognized as being D-finite. In some cases, we are able to prove the conjectured recurrence. In some cases, we are not able to…

Symbolic Computation · Computer Science 2023-04-26 Manuel Kauers , Christoph Koutschan

The aim of this paper is to develop foundations of umbral calculus on the space $\mathcal D'$ of distributions on $\mathbb R^d$, which leads to a general theory of Sheffer polynomial sequences on $\mathcal D'$. We define a sequence of monic…

Functional Analysis · Mathematics 2019-04-29 Dmitri Finkelshtein , Yuri Kondratiev , Eugene Lytvynov , Maria Joao Oliveira

In studying the complexity of iterative processes it is usually assumed that the arithmetic operations of addition, multiplication, and division can be performed in certain constant times. This assumption is invalid if the precision…

Computational Complexity · Computer Science 2021-03-22 Richard P. Brent

We prove that if A is a finite algebra with a parallelogram term that satisfies the split centralizer condition, then A is dualizable. This yields yet another proof of the dualizability of any finite algebra with a near unanimity term, but…

Rings and Algebras · Mathematics 2016-01-01 Keith A. Kearnes , Agnes Szendrei

The implementation of discontinuous Galerkin finite element methods (DGFEMs) represents a very challenging computational task, particularly for systems of coupled nonlinear PDEs, including multiphysics problems, whose parameters may consist…

Numerical Analysis · Computer Science 2018-04-09 Paul Houston , Nathan Sime

An open problem posed by the first author is the complexity to decide whether a sequence of nonnegative integer numbers can be the final score of a football tournament. In this paper we propose polynomial time approximate and exponential…

Discrete Mathematics · Computer Science 2012-07-27 A. Iványi , J. E. Schoenfield

A method is developed for calculating effective sums of divergent series. This approach is a variant of the self-similar approximation theory. The novelty here is in using an algebraic transformation with a power providing the maximal…

Statistical Mechanics · Physics 2009-10-30 V. I. Yukalov , S. Gluzman

We apply a novel method for the equivalence group and its infinitesimal generators to the investigation of invariants of linear ordinary differential equations. First, a comparative study of this method is illustrated by an example. Next,…

Analysis of PDEs · Mathematics 2008-06-27 J. C. Ndogmo

We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…

Number Theory · Mathematics 2015-07-22 Andrew N. W. Hone

Superspecies are introduced to provide the nice constructions of all finite-dimensional superalgebras. All acyclic superspecies, or equivalently all finite-dimensional (gr-basic) gr-hereditary superalgebras, are classified according to…

Rings and Algebras · Mathematics 2007-10-12 Yang Han , Deke Zhao

Finite and Infinite-dimensional representations of symmetry algebras play a significant role in determining the spectral properties of physical Hamiltonians. In this paper, we introduce and apply a practical method to construct infinite…

Mathematical Physics · Physics 2023-08-15 Ian Marquette , Junze Zhang , Yao-Zhong Zhang

We extend the definition of algebraic entropy to semi-discrete (difference-differential) equations. Calculating the entropy for a number of integrable and non integrable systems, we show that its vanishing is a characteristic feature of…

Exactly Solvable and Integrable Systems · Physics 2015-06-05 D. K. Demskoi , C-M. Viallet

Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…

Symbolic Computation · Computer Science 2026-01-14 Louis Gaillard

We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…

Combinatorics · Mathematics 2020-10-13 Mirko D'Ovidio , Anna Chiara Lai , Paola Loreti

In this paper, we introduce the polynomial continued fraction, a close relative of the well-known simple continued fraction expansions which are widely used in number theory and in general. While they may not possess all the intriguing…

Dynamical Systems · Mathematics 2023-12-04 Ofir David

Our main objective is to show that the computational methods that we previously developed to search for difference families in cyclic groups can be fully extended to the more general case of arbitrary finite abelian groups. In particular…

Combinatorics · Mathematics 2024-01-23 Dragomir Z. Djokovic , Ilias S. Kotsireas

We define a proper differential sequence of ordinary differential equations and introduce a method to derive an alternative sequence of integrals for such a sequence. We describe some general properties which are illustrated by several…

Exactly Solvable and Integrable Systems · Physics 2015-05-13 N. Euler , P. G. L. Leach

We propose an algebraic geometric approach for studying rational solutions of first-order algebraic ordinary difference equations. For an autonomous first-order algebraic ordinary difference equations, we give an upper bound for the degrees…

Symbolic Computation · Computer Science 2019-02-05 Thieu N. Vo , Yi Zhang

Over an arbitrary field of positive characteristic we construct an example of a locally finite variety of Lie algebras which does not have a finite basis of its polynomial identities. As a consequence we construct varieties of Lie algebras…

Rings and Algebras · Mathematics 2023-01-31 Vesselin S. Drensky

Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…

Logic in Computer Science · Computer Science 2022-07-21 Gershom Bazerman
‹ Prev 1 8 9 10 Next ›