Related papers: On Hermite's problem, Jacobi-Perron type algorithm…
Motivated by a historical combinatorial problem that resembles the well-known Josephus problem, we investigate circular partition algorithms and formulate problems in deterministic finite automata with practical algorithms. The historical…
Working with exhaustive search on large dataset is infeasible for several reasons. Recently, developed techniques that made pattern set mining feasible by a general solver with long execution time that supports heuristic search and are…
In this paper, we derive a Fast Reflected Forward-Backward (Fast RFB) algorithm to solve the problem of finding a zero of the sum of a maximally monotone operator and a monotone and Lipschitz continuous operator in a real Hilbert space. Our…
Multidimensional continued fractions (MCFs) were introduced by Jacobi and Perron in order to generalize the classical continued fractions. In this paper, we propose an introductive fundamental study about MCFs in the field of the $p$--adic…
We propose an effective algorithm that enumerates (and actually finds) all 3-edge colorings and Hamiltonian cycles in a cubic graph. The idea is to make a preliminary run that separates the vertices into two types: ``rigid'' (such that the…
In this paper we establish periodic homogenization for Hamilton-Jacobi-Bellman (HJB) equations, associated to nonlocal operators of integro-differential type. We consider the case when the fractional diffusion has the same order as the…
Heron, in Metrica III.20-22, is concerned with the the division of solid figures - pyramids, cones and frustra of cones - to which end there is a need to extract cube roots. We report here on some of our findings on the conjecture by…
We propose a stochastic variance-reduced cubic regularized Newton method for non-convex optimization. At the core of our algorithm is a novel semi-stochastic gradient along with a semi-stochastic Hessian, which are specifically designed for…
In the first part of the paper, we study the discontinuous Galerkin (DG) and $C^0$ interior penalty ($C^0$-IP) finite element approximation of the periodic strong solution to the fully nonlinear second-order…
For families of Hamiltonians defined by parts that are local, the most general definition of a symmetry algebra is the commutant algebra, i.e., the algebra of operators that commute with each local part. Thinking about symmetry algebras as…
Quantum optimization algorithms hold the promise of solving classically hard, discrete optimization problems in practice. The requirement of encoding such problems in a Hamiltonian realized with a finite -- and currently small -- number of…
We use the universal generation of algebraic cycles to relate (stable) rationality to the integral Hodge conjecture. We show that the Chow group of 1-cycles on a cubic hypersurface is universally generated by lines. Applications are mainly…
A simple iterative scheme is proposed for locating the parameter values for which a 2-parameter family of real symmetric matrices has a double eigenvalue. The convergence is proved to be quadratic. An extension of the scheme to complex…
The goal of this paper is to investigate new and simple convergence analysis of dynamic programming for linear quadratic regulator problem of discrete-time linear time-invariant systems. In particular, bounds on errors are given in terms of…
High-order tensor methods for solving both convex and nonconvex optimization problems have generated significant research interest, leading to algorithms with optimal global rates of convergence and local rates that are faster than Newton's…
The classical theory of continued fractions has been widely studied for centuries for its important properties of good approximation, and more recently it has been generalized to $p$-adic numbers where it presents many differences with…
The Yakubovich Frequency Theorem, in its periodic version and in its general nonautonomous extension, establishes conditions which are equivalent to the global solvability of a minimization problem of infinite horizon type, given by the…
We develop a novel unified randomized block-coordinate primal-dual algorithm to solve a class of nonsmooth constrained convex optimization problems, which covers different existing variants and model settings from the literature. We prove…
Cyclic reduction is a method for the solution of (block-)tridiagonal linear systems. In this note we review the method tailored to hermitian positive definite banded linear systems. The reviewed method has the following advantages: It is…
Cima, Ma\~{n}osas and Villadelprat (J. Differ. Equations, 157, 373--413, 1999) proved that a cubic Hamiltonian system possesses an isochronous center at the origin if and only if its Hamiltonian function can be expressed as…