Related papers: Generalized ODE reduction algorithm with bounded d…

Estimating the average degree of graph is a classic problem in sublinear graph algorithm. Eden, Ron, and Seshadhri (ICALP 2017, SIDMA 2019) gave a simple algorithm for this problem whose running time depended on the graph arboricity, but…

This paper proposes a trigonometric interpolation-based approach (TIBA) to approximate solutions of mixed boundary value problems of second-order ODEs. TIBA leverages the analytic attractiveness of a trigonometric polynomial to reformulate…

Finite-dimensional subalgebras of a Lie algebra of smooth vector fields on a circle, as well as piecewise-smooth global transformations of a circle on itself, are considered. A canonical forms of realizations of two- and three-dimensional…

Point transformations for the ordinary differential equations of the form $y''=P(x,y)+3 Q(x,y) y'+3 R(x,y) (y')^2+S(x,y) (y')^3$ are considered. Some classical results are resumed. Solution for the equivalence problem for the equations of…

We use Cramer's formula for the inverse of a matrix and a combinatorial expression for the determinant in terms of paths of an associated digraph (which can be traced back to Coates) to give a combinatorial interpretation of M\"obius…

The main goal of this article is to show a new method to solve some Fractional Order Integral Equations (FOIE), more precisely the ones which are linear, have constant coefficients and all the integration orders involved are rational. The…

Recently a nice work about the understanding of one-loop integrals has been done in [1] using the tricks of the projective space language associated to their Feynman parametrization. We find this language is also very suitable to deal with…

The artificial neural network is a popular framework in machine learning. To empower individual neurons, we recently suggested that the current type of neurons could be upgraded to 2nd order counterparts, in which the linear operation…

The goal in {\em reconfiguration problems} is to compute a {\em gradual transformation} between two feasible solutions of a problem such that all intermediate solutions are also feasible. In the {\em Matching Reconfiguration Problem} (MRP),…

We construct a universal Vertex-IRF transformation between Vertex type universal solution and Face type universal solution of the quantum dynamical Yang-Baxter equation. This universal Vertex-IRF transformation satisfies the generalized…

This paper deals with the index reduction problem for the class of quasi-regular DAE systems. It is shown that any of these systems can be transformed to a generically equivalent first order DAE system consisting of a single purely…

Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…

In this paper, we study the complexity of solving generic over-determined bilinear systems over a finite field $\mathbb{F}$. Given a generic bilinear sequence $B \in \mathbb{F}[\mathbf{x},\mathbf{y}]$, with respect to a partition of…

The thermodynamic Bethe ansatz approach to the study of integrable quantum field theories was introduced in the early 90s. Since then it has been known that the thermodynamic Bethe ansatz equations can be recast in the form of $Y$-systems.…

We consider the following inverse problem for an ordinary differential equation (ODE): given a set of data points $P=\{(t_i,x_i),\; i=1,\dots,N\}$, find an ODE $x^\prime(t) = v (x)$ that admits a solution $x(t)$ such that $x_i \approx…

A bottleneck of a smooth algebraic variety $X \subset \mathbb{C}^n$ is a pair of distinct points $(x,y) \in X$ such that the Euclidean normal spaces at $x$ and $y$ contain the line spanned by $x$ and $y$. The narrowness of bottlenecks is a…

There are two ways to compute Poincar\'e-Dulac normal forms of systems of ODEs. Under the original approach used by Poincar\'e the normalizing transformation is explicitly computed. On each step, the normalizing procedure requires the…

For a prime $p$ and an absolutely irreducible modulo $p$ polynomial $f(U,V) \in \Z[U,V]$ we obtain an asymptotic formulas for the number of solutions to the congruence $f(x,y) \equiv a \pmod p$ in positive integers $x \le X$, $y \le Y$,…

Let $k$ be a field of characteristic zero, and let $f: k[x,y] \to k[x,y]$, $f: (x,y) \mapsto (p,q)$, be a $k$-algebra endomorphism having an invertible Jacobian. Write $p=a_ny^n+\cdots+a_1y+a_0$, where $n=deg_y(p) \in \mathbb{N}$, $a_i \in…

Advanced optimization algorithms such as Newton method and AdaGrad benefit from second order derivative or second order statistics to achieve better descent directions and faster convergence rates. At their heart, such algorithms need to…