arXiv research

We create a flat end foliation by critical spheres solving a Laplace-Beltrami problem.

A new method for compressive classification using bridge regression.

We study Willmore surfaces of constant Moebius curvature $K$ in $S^4$. It is proved that such a surface in $S^3$ must be part of a minimal surface in $R^3$ or the Clifford torus. Another result in this paper is that an isotropic surface (hence also Willmore) in $S^4$ of constant $K$ could only be part of a complex curv…

We investigate non-degenerate Lagrangians of the form $\int f(u_x, u_y, u_t) dx dy dt$ such that the corresponding Euler-Lagrange equations $(f_{u_x})_x+ (f_{u_y})_y+ (f_{u_t})_t=0$ are integrable by the method of hydrodynamic reductions. We demonstrate that the integrability conditions, which constitute an invol…

Let $(\mathcal{M},g)$ be a compact Riemannian manifold of dimension $N$, $N\geq 2$. In this paper, we prove that there exists a family of domains $(Ω_\varepsilon)_{\varepsilon\in(0,\varepsilon_0)}$ and functions $u_\varepsilon$ such that $ -Δ_{g} u_\varepsilon=1 \quad \textrm{ in } Ω_\varepsilon, \quad u_\varepsilon=0 …

Kaczmarz++ accelerates convergence for ill-conditioned systems.

The classification of isoparametric hypersurfaces with four principal curvatures in spheres in [2] hinges on a crucial characterization, in terms of four sets of equations of the 2nd fundamental form tensors of a focal submanifold, of an isoparametric hypersurface of the type constructed by Ferus, Karcher and Münzner. …

We investigate second order quasilinear equations of the form f_{ij} u_{x_ix_j}=0 where u is a function of n independent variables x_1, ..., x_n, and the coefficients f_{ij} are functions of the first order derivatives p^1=u_{x_1}, >..., p^n=u_{x_n} only. We demonstrate that the natural equivalence group of the problem…

Blind Source Separation (BSS) has proven to be a powerful tool for the analysis of composite patterns in engineering and science. We introduce Convex Analysis of Mixtures (CAM) for separating non-negative well-grounded sources, which learns the mixing matrix by identifying the lateral edges of the convex data scatter p…

Introduces Plücker coordinates for a complex projective octonion plane, solving an overdetermined system of relations.

We survey the status of some decision problems for 3-manifolds and their fundamental groups. This includes the classical decision problems for finitely presented groups (Word Problem, Conjugacy Problem, Isomorphism Problem), and also the Homeomorphism Problem for 3-manifolds and the Membership Problem for 3-manifold gr…

Optimal transport reformulates multiple quantile hedging problem.

Solves four problems related to circle families in the plane.

Solves four problems related to sphere families in 3D space.

The paper solves optimal control problems for various convex sets using convex trigonometry.

This paper is a tutorial for eigenvalue and generalized eigenvalue problems. We first introduce eigenvalue problem, eigen-decomposition (spectral decomposition), and generalized eigenvalue problem. Then, we mention the optimization problems which yield to the eigenvalue and generalized eigenvalue problems. We also prov…

This paper solves the Christoffel problem in hyperbolic space and its equivalent on spheres.

In the present paper, the primal-dual problem consisting of the investment risk minimization problem and the expected return maximization problem in the mean-variance model is discussed using replica analysis. As a natural extension of the investment risk minimization problem under only a budget constraint that we anal…

Study proves only origin-centered spheres solve certain curvature problems.

MathChat uses LLM agents to solve challenging math problems through conversational problem-solving.

The paper solves a generalized Christoffel-Minkowski problem using a curvature flow.

Paper solves Gromov-Wasserstein for point clouds efficiently.

The paper explains how microlocal analysis solves geometric inverse problems.

Proves NP and co-NP status for knot core recognition in solid torus.

The min-max problem, also known as the saddle point problem, is a class of optimization problems which minimizes and maximizes two subsets of variables simultaneously. This class of problems can be used to formulate a wide range of signal processing and communication (SPCOM) problems. Despite its popularity, most exist…

A new method solves complex control problems with random coefficients.

This is a survey of some problems in geometric group theory which I find interesting. The problems are from different areas of group theory. Each section is devoted to problems in one area. It contains an introduction where I give some necessary definitions and motivations, problems and some discussions of them. For ea…

We present updates to the problems on Hirzebruch's 1954 problem list focussing on open problems, and on those where substantial progress has been made in recent years. We discuss some purely topological problems, as well as geometric problems about (almost) complex structures, both algebraic and non-algebraic, about co…

New method solves generalized Minkowski problem for torsional rigidity.

We present 27 problems encountered in automating the translation of movie/TV show subtitles. We categorize each problem in one of the three categories viz. problems directly related to textual translation, problems related to subtitle creation guidelines, and problems due to adaptability of machine translation (MT) eng…

Solves Brezis' first open problem on ball solutions.

Classical knot recognition problem solved in NP with exponential time algorithm.

Ranking problems, also known as preference learning problems, define a widely spread class of statistical learning problems with many applications, including fraud detection, document ranking, medicine, credit risk screening, image ranking or media memorability. In this article, we systematically review different types…

Paper solves four problems of pseudo-circle envelopes in Minkowski plane.

In this paper, we address the inverse problem, or the statistical machine learning problem, in Markov random fields with a non-parametric pair-wise energy function with continuous variables. The inverse problem is formulated by maximum likelihood estimation. The exact treatment of maximum likelihood estimation is intra…

Conference compiles problems on foliations and diffeomorphisms.

Describes state variables in sequential decision problems, linking them to Markovian and non-Markovian models.

Solves double coset problem for braid group H_n.

In this paper, we discuss the uniqueness in an integral geometry problem in a strongly convex domain. Our problem is related to the problem of finding a Riemannian metric by the distances between all pairs of the boundary points. For the proof, the problem is reduced to an inverse source problem for a kinetic equation …

This paper solves the dual Minkowski problem for q-torsional rigidity.

Study on geometric variational problems for existence, regularity, and uniqueness of solutions.

Solves a discrete logarithmic Minkowski problem for electrostatic p-capacity.

Study on biharmonic Steklov problems with Neumann boundary conditions and eigenvalue estimates.

Machine learning reduces combinatorial optimization problem dimensions.

New reformulations for multiclass classification problems using optimal transport.

Study anisotropic flows solving Orlicz-Minkowski problems, proving existence and new results.

In this paper we consider stochastic optimization problems for an ambiguity averse decision maker who is uncertain about the parameters of the underlying process. In a first part we consider problems of optimal stopping under drift ambiguity for one-dimensional diffusion processes. Analogously to the case of ordinary o…

MCGDiff uses SGM to guide SMC for solving ill-posed linear inverse problems.