English
Related papers

Related papers: Decomposable forms generated by linear recurrences

200 papers

Six families of generalized hypergeometric series in a variable $x$ and an arbitrary number of parameters are considered. Each of them is indexed by an integer $n$. Linear recurrence relations in $n$ relate these functions and their product…

Classical Analysis and ODEs · Mathematics 2022-10-25 Nicolas Brisebarre , Bruno Salvy

In this paper, we show that a partitioned formula \phi is dependent if and only if \phi has uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by…

Logic · Mathematics 2011-08-12 Vincent Guingona

We study copositive matrices which admit a decomposition into a sum of a positive semidefinite matrix and a matrix with nonnegative entries. Our main result shows that if the off-diagonal entries of a copositive matrix are nondecreasing in…

Optimization and Control · Mathematics 2026-05-18 Grigoriy Blekherman , Santanu S. Dey , Alex Dunbar , Burak Kocuk

We study the decomposition of central simple algebras of exponent 2 into tensor products of quaternion algebras. We consider in particular decompositions in which one of the quaternion algebras contains a given quadratic extension. Let $B$…

Rings and Algebras · Mathematics 2013-04-10 Demba Barry

We generalize the logarithmic decomposition theorem of Deligne-Illusie to a filtered version. There are two applications. The easier one provides a mod $p$ proof for a vanishing theorem in characteristic zero. The deeper one gives rise to a…

Algebraic Geometry · Mathematics 2021-09-07 Zebao Zhang

In this paper we discourse basises of representable algebras. This question lead to arithmetic problems. We prove algorithmical solvability of exponential-Diophantine equations in rings represented by matrices over fields of positive…

Rings and Algebras · Mathematics 2020-05-12 A. A. Chilikov , A. Ya. Belov

In this paper we give a purely categorical construction of d-fold matrix factorizations of a natural transformation, for any even integer d. This recovers the classical definition of those for regular elements in commutative rings due to…

K-Theory and Homology · Mathematics 2023-08-30 Petter Andreas Bergh , David A. Jorgensen

The functional ANOVA, or Hoeffding decomposition, provides a principled framework for interpretability by decomposing a model prediction into main effects and higher-order interactions. For independent inputs, this classical decomposition…

Machine Learning · Statistics 2026-05-19 Baptiste Ferrere , Nicolas Bousquet , Fabrice Gamboa , Jean-Michel Loubes

Consider a sequence of real-valued functions of a real variable given by a homogeneous linear recursion with differentiable coefficients. We show that if the functions in the sequence are differentiable, then the sequence of derivatives…

Functional Analysis · Mathematics 2025-03-05 Dávid Papp , Kolos Csaba Ágoston

This paper studies the problem of decomposing a low-rank matrix into a factor with binary entries, either from $\{\pm 1\}$ or from $\{0,1\}$, and an unconstrained factor. The research answers fundamental questions about the existence and…

Data Structures and Algorithms · Computer Science 2019-08-01 Richard Kueng , Joel A. Tropp

Let $(U_n)_{n\geq 0}$ be a fixed linear recurrence sequence of integers with order at least two, and for any positive integer $\ell$, let $\ell \cdot 2^{\ell} + 1$ be a Cullen number. Recently in \cite{bmt}, generalized Cullen numbers in…

Number Theory · Mathematics 2020-10-21 Nabin Kumar Meher , Sudhansu Sekhar Rout

In this paper, we introduce the degenerate central factorial polynomials and numbers of the second kind which are degenerate versions of the central factorial polynomials and numbers of the second kind. We derive some properties and…

Number Theory · Mathematics 2019-02-13 Taekyun Kim , Dae san Kim

This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…

Number Theory · Mathematics 2021-09-21 Alessio Moscariello

We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure…

Combinatorics · Mathematics 2018-09-26 Per Alexandersson

In this paper, we study some new factorizations of period-doubling sequences over a $k$-letter alphabet, where $k\geq 2$. First, we define the combinatorial and arithmetic properties of these sequences. Then, we define the kernel words of…

Combinatorics · Mathematics 2025-11-27 K. Ernest Bognini , Hamdi Ammar

We present in this paper a general algorithm for solving first-order formulas in particular theories called "decomposable theories". First of all, using special quantifiers, we give a formal characterization of decomposable theories and…

Logic in Computer Science · Computer Science 2007-05-23 Khalil Djelloul

We present a general method for analytically factorizing the n-fold form factor integrals $f^{(n)}_{N,N}(t)$ for the correlation functions of the Ising model on the diagonal in terms of the hypergeometric functions…

Mathematical Physics · Physics 2015-05-27 M. Assis , J-M. Maillard , B. M. McCoy

In this paper we show that an arbitrary solution of one ordinary difference equation is also a solution for a hierarchy of integrable difference equations. We also provide an example of such a solution that is related to sequence generated…

Exactly Solvable and Integrable Systems · Physics 2022-01-25 Andrei K. Svinin

Given any polynomial $p$ in $C[X]$, we show that the set of irreducible matrices satisfying $p(A)=0$ is finite. In the specific case $p(X)=X^2-nX$, we count the number of irreducible matrices in this set and analyze the arising sequences…

Combinatorics · Mathematics 2018-05-11 Erik Thörnblad , Jakob Zimmermann

A method is presented that reduces the number of terms of systems of linear equations (algebraic, ordinary and partial differential equations). As a byproduct these systems have a tendency to become partially decoupled and are more likely…

Symbolic Computation · Computer Science 2007-05-23 Thomas Wolf