Related papers: Feasible Proofs of Matrix Properties with Csanky's…

We show how the continuous Almkvist-Zeilberger algorithm can be used to efficiently discover and prove differential equations satisfied by generating functions of sequences defined as integrals of powers of C-finite polynomial sequences…

Let $ \nu $ be a probability distribution over the linear semi-group $ \mathrm{End}(E) $ for $ E $ a finite dimensional vector space over a locally compact field. We assume that $ \nu $ is proximal, strongly irreducible and that $…

We obtain a necessary and sufficient condition for the linear independence of solutions of differential equations for hyperlogarithms. The key fact is that the multiplier (i.e. the factor $M$ in the differential equation $dS=MS$) has only…

Let $(x_1,y_1),\ldots,(x_n,y_n)$ be distinct non-constant and non-degenerate solutions of the classical Lotka-Volterra system \begin{equation}\notag \begin{split} x'&= axy + bx\\ y'&= cxy + dy, \end{split} \end{equation} where…

We give an algorithm for constructing the algebraic hull of a given matrix Lie algebra in characteristic zero. It is based on an algorithm for finding integral linear dependencies of the roots of a polynomial, that is probably of…

We provide new results concerning label efficient, polynomial time, passive and active learning of linear separators. We prove that active learning provides an exponential improvement over PAC (passive) learning of homogeneous linear…

A synopsis is offered of the properties of discrete and integer-valued, hence "natural", cellular automata (CA). A particular class comprises the "Hamiltonian CA" with discrete updating rules that resemble Hamilton's equations. The…

In 2007, Papanikolas established that if Carlitz logarithms of algebraic functions are linearly independent over the rational function field, then they are algebraically independent. The purpose of the present paper is to provide a new…

Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…

We consider a generic algorithmic paradigm that we call progressive exploration, which can be used to develop simple and efficient parameterized graph algorithms. We identify two model-theoretic properties that lead to efficient progressive…

Given a graph G, an incidence matrix N(G) is defined for the set of distinct isomorphism types of induced subgraphs of G. If Ulam's conjecture is true, then every graph invariant must be reconstructible from this matrix, even when the…

The PC algorithm is the state-of-the-art algorithm for causal structure discovery on observational data. It can be computationally expensive in the worst case due to the conditional independence tests are performed in an…

The algorithms in the current sequential numerical linear algebra libraries (e.g. LAPACK) do not parallelize well on multicore architectures. A new family of algorithms, the tile algorithms, has recently been introduced. Previous research…

An Independent Parallelism Theorem is proven in the theory of adhesive HLR categories. It shows the bijective correspondence between sequential independent and parallel independent direct derivations in the Weak Double-Pushout framework,…

We study Satisfiability Modulo Theories (SMT) enriched with the so-called Ramsey quantifiers, which assert the existence of cliques (complete graphs) in the graph induced by some formulas. The extended framework is known to have…

Let $G=\{e^{tA}:t\in\mathbb{R}\}$ be a closed one-parameter subgroup of the general linear group of matrices of order $n$ acting on $\mathbb{R}^{n}$ by matrix-vector multiplications. We assume that all eigenvalues of $A$ are rationally…

Let K be an infinite field and let R be a K-algebra endowed with a homogeneous polynomial norm N of degree n. If N satisfies a formal analogue of the Cayley-Hamilton Theorem the we will show that R is a quotient of the ring of the…

For years, independence has been considered as an important concept in many disciplines. Nevertheless, we present the first research that investigates the discovery problem of independence in data. In its arguably simplest form,…

We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…

We develop a new method for proving algebraic independence of $G$-functions. Our approach rests on the following observation: $G$-functions do not always come with a single linear differential equation, but also sometimes with an infinite…