Related papers: Conjugacy search problem and the Andrews-Curtis co…
This work introduces a moving anchor acceleration technique to extragradient algorithms for smooth structured minimax problems. The moving anchor is introduced as a generalization of the original algorithmic anchoring framework, i.e. the…
In this paper, we study the Johnson homomorphisms of basis-conjugating automorphism groups of free groups. We construct obstructions for the surjectivity of the Johnson homomorphisms. By using it, we determine its cokernels of degree up to…
Triangulations and higher triangulations axiomatize the calculus of derived cokernels when applied to strings of composable morphisms. While there are no cubical versions of (higher) triangulations, in this paper we use coherent diagrams to…
We study reversibility and strong reversibility of affine automorphisms of the two-torus, written as $f_{A,\bar{a}}(\bar{x})=A\bar{x}+\bar{a} \ (\mathrm{mod}\ \mathbb{Z}^2)$. We derive explicit criteria for the reversibility of such maps in…
Original proofs of the AGT relations with the help of the Hubbard-Stratanovich duality of the modified Dotsenko-Fateev matrix model did not work for beta different from one, because Nekrasov functions were not properly reproduced by…
Approximate Simultaneous Diagonalization (ASD) is a problem to find a common similarity transformation which approximately diagonalizes a given square-matrix tuple. Many data science problems have been reduced into ASD through ingenious…
A comparative study of different block matching alternatives for motion estimation is presented. The study is focused on computational burden and objective measures on the accuracy of prediction. Together with existing algorithms several…
We propose an induction scheme that aims at establishing the stable Andrews-Curtis conjecture in the affirmative. The stable Andrews-Curtis conjecture is equivalent to the conjecture that every contractible fake surface is 3-deformable to a…
The alternating direction method of multipliers (ADMM) were extensively investigated in the past decades for solving separable convex optimization problems. Fewer researchers focused on exploring its convergence properties for the nonconvex…
We develop a new framework for establishing approximate factorization of entropy on arbitrary probability spaces, using a geometric notion known as non-negative sectional curvature. The resulting estimates are equivalent to entropy…
In this paper, we consider solving a class of nonconvex and nonsmooth problems frequently appearing in signal processing and machine learning research. The traditional alternating direction method of multipliers encounters troubles in both…
Quantum query complexity is typically characterized in terms of XOR queries |x,y> to |x,y+f(x)> or phase queries, which ensure that even queries to non-invertible functions are unitary. When querying a permutation, another natural model is…
Since its invention in 2014, the Adam optimizer has received tremendous attention. On one hand, it has been widely used in deep learning and many variants have been proposed, while on the other hand their theoretical convergence property…
In this series of papers, we investigate a new anabelian phenomenon of curves over algebraically closed fields of positive characteristic. Let $\overline M_{g, n}$ be the moduli space of curves of type $(g, n)$ over $\overline…
We show that certain isomorphisms of (twisted) KR-groups that underlie T-dualities of torus orientifold string theories have purely algebraic analogues in terms of algebraic K-theory of real varieties and equivalences of derived categories…
We propose new iterative methods for computing nontrivial extremal generalized singular values and vectors. The first method is a generalized Davidson-type algorithm and the second method employs a multidirectional subspace expansion…
We discuss three applications of efficient quantum algorithms to determining properties of permutations and group automorphisms. The first uses the Bernstein-Vazirani algorithm to determine an unknown homomorphism from $Z_{p-1}^{m}$ to…
We give an algorithm to solve the Conjugacy Problem for ascending HNN-extensions of free groups. To do this, we give algorithms to solve certain problems on dynamics of free group endomorphisms.
In this paper, we study a class of non-convex optimization problems known as multi-affine quadratic equality constrained problems, which appear in various applications--from generating feasible force trajectories in robotic locomotion and…
Motivated by proving the loss of ergodicity in expanding systems of piecewise affine coupled maps with arbitrary number of units, all-to-all coupling and inversion symmetry, we provide ad-hoc substitutes - namely inversion-symmetric maps of…