Related papers: Multi-quadratic quad equations: integrable cases f…
The aim of this paper is to introduce and study a large class of $\mathfrak{g}$-module algebras which we call factorizable by generalizing the Gauss factorization of (square or rectangular) matrices. This class includes coordinate algebras…
We establish a new class of integrable {\it systems of Kowalevski type}, associated with discriminantly separable polynomials of degree two in each of three variables. Defining property of such polynomials, that all discriminants as…
In this paper, we study additively indecomposable quadratic forms over real biquadratic and simplest cubic fields. In particular, we show that over these fields, we can always find such a classical form in 2 variables, which differs from…
We introduce An(1) (n=1,2,...) affine quiver matrix model by simply adopting the extended Cartan matrices as incidence matrices and study its finite N Schwinger-Dyson equations as well as their planar limit. In the case of n=1, we extend…
Generalizing Eisenbud's matrix factorizations, we define factorization categories. Following work of Positselski, we define their associated derived categories. We construct specific resolutions of factorizations built from a choice of…
Counting integral binary quadratic forms with certain restrictions is a classical problem. In this paper, we count binary quadratic forms of fixed discriminant given restrictions on the size of their coefficients. We accomplish this by…
We study polynomial functors of degree 2, called quadratic, with values in the category of abelian groups $Ab$, and whose source category is an arbitrary category $\C$ with null object such that all objects are colimits of copies of a…
We suggest an approach for description of integrable cases of the Abel equations. It is based on increasing of the order of equations up to the second one and using equivalence transformations for the corresponding second-order ordinary…
In this paper, we prove that a binary definite quadratic form over F_q[t], where q is odd, is completely determined up to equivalence by the polynomials it represents up to degree 3m-2, where m is the degree of its discriminant. We also…
In the context of integrable partial difference equations on quad-graphs, we introduce the notion of open boundary reductions as a new means to construct discrete integrable mappings and their invariants. This represents an alternative to…
Consider a multi-class labelling problem, where the labels can take values in $[k]$, and a predictor predicts a distribution over the labels. In this work, we study the following foundational question: Are there notions of multi-class…
We globally classify two-component evolution equations, with homogeneous diagonal linear part, admitting infinitely many approximate symmetries. Important ingredients are the symbolic calculus of Gel'fand and Dikii, the Skolem-Mahler-Lech…
We show that integrable involutive maps, due to the fact they admit three integrals in separated form, can give rise to equations, which are consistent around the cube and which are not in the multiaffine form assumed in papers [1, 2].…
Adaptive Bayesian quadrature (ABQ) is a powerful approach to numerical integration that empirically compares favorably with Monte Carlo integration on problems of medium dimensionality (where non-adaptive quadrature is not competitive). Its…
The existence of an infinite set of conserved currents in completely integrable classical models, including chiral and Toda models as well as the KP and self-dual Yang-Mills equations, is traced back to a simple construction of an infinite…
Integrable discrete scalar equations defined on a~two or a three dimensional lattice can be rewritten as difference systems in bond variables or in face variables respectively. Both the difference systems in bond variables and the…
The problem of classification into symmetry integrable classes is solved for a family of second order nonlinear evolution equations labeled by arbitrary functions. Four nonequivalent symmetry integrable classes are thus obtained and the…
Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of variables. The base algorithm can be…
Causal models are playing an increasingly important role in machine learning, particularly in the realm of explainable AI. We introduce a conceptualisation for generating argumentation frameworks (AFs) from causal models for the purpose of…
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…