Related papers: Linearisable Mappings and the Low-Growth Criterion
An algorithmic method using conservation law multipliers is introduced that yields necessary and sufficient conditions to find invertible mappings of a given nonlinear PDE to some linear PDE and to construct such a mapping when it exists.…
The `deautonomisation' of an integrable mapping of the plane consists in treating the free parameters in the mapping as functions of the independent variable, the precise expressions of which are to be determined with the help of a suitable…
Variational problems of splitting-type with mixed linear-superlinear growth conditions are considered. In the twodimensional case the minimizing problem is given by \[ J [w] = \int_{\Omega} \Big[f_1\big(\partial_1 w\big) +…
For a bilinear map $*:\mathbb R^d\times \mathbb R^d\to \mathbb R^d$ of nonnegative coefficients and a vector $s\in \mathbb R^d$ of positive entries, among an exponentially number of ways combining $n$ instances of $s$ using $n-1$…
In this paper, we propose an evolving network model growing fast in units of module, based on the analysis of the evolution characteristics in real complex networks. Each module is a small-world network containing several interconnected…
We consider general integrable systems on graphs as discrete flat connections with the values in loop groups. We argue that a certain class of graphs is of a special importance in this respect, namely quad-graphs, the cellular…
We consider several characterizations of $\mathbb R$-linear mappings. In particular, we give a characterization of linear mappings whose range is $\geq$ 2 dimensional, in terms of preservation of lines (and contraction of lines to a point)…
Motivated by regression analysis for microbiome compositional data, this paper considers generalized linear regression analysis with compositional covariates, where a group of linear constraints on regression coefficients are imposed to…
Linear codes are widely studied in coding theory as they have nice applications in distributed storage, combinatorics, lattices, cryptography and so on. Constructing linear codes with desirable properties is an interesting research topic.…
We explore the conjectured duality between a class of large $N$ matrix integrals, known as multicritical matrix integrals (MMI), and the series $(2m-1,2)$ of non-unitary minimal models on a fluctuating background. We match the critical…
We introduce an efficient first-order primal-dual method for the solution of nonsmooth PDE-constrained optimization problems. We achieve this efficiency through not solving the PDE or its linearisation on each iteration of the optimization…
We here show that the family of continuous-time linear systems (of prescribed dimensions) can be characterized through the structure of maximal, matrix-convex, cones, closed under inversion. Moreover, this observation unifies three setups:…
We study the learning ability of linear recurrent neural networks with Gradient Descent. We prove the first theoretical guarantee on linear RNNs to learn any stable linear dynamic system using any a large type of loss functions. For an…
We present a quasi-integrable two-dimensional lattice equation: i.e., a partial difference equation which satisfies a criterion of integrability, singularity confinement, although it has a chaotic aspect in the sense that the degrees of its…
We propose a model to create synthetic networks that may also serve as a narrative of a certain kind of infrastructure network evolution. It consists of an initialization phase with the network extending tree-like for minimum cost and a…
We present an algorithmic method for the calculation of the degrees of the iterates of birational mappings, based on Halburd's method for obtaining the degrees from the singularity structure of the mapping. The method uses only integer…
Well-graded families, extremal systems and maximum systems (the last two in the sense of VC-theory and Sauer-Shelah lemma on VC-dimension) are three important classes of set systems. This paper aims to study the notion of duality in the…
We consider a one-parameter family of invertible maps of a two-dimensional lattice, obtained by discretising the space of planar rotations. We let the angle of rotation approach $\pi/2$, and show that the limit of vanishing discretisation…
A list of forty third-order exactly integrable two-field evolutionary systems is presented. Differential substitutions connecting various systems from the list are found. It is proved that all the systems can be obtained from only two of…
In this work, we show that for linearly constrained optimization problems the primal-dual hybrid gradient algorithm, analyzed by Chambolle and Pock [3], can be written as an entirely primal algorithm. This allows us to prove convergence of…