Related papers: A New Take on Classic 'Pen Problems'
The paper studies the harmonic maps on a direction between a Riemannian space and a generalized Lagrange space. Also, it is proved there that the solutions of C^2 class of certain ODEs or PDEs are harmonic maps, in the sense of this paper.
In this paper, we study the restrictions on the number $m$ of conic-line curves in special pencils. The most general result we obtain is the relation between upper bounds on $m$ and the number $p$ of concurrent lines in these pencils. We…
We present classical and quantum algorithms based on spectral methods for a problem in tensor principal component analysis. The quantum algorithm achieves a quartic speedup while using exponentially smaller space than the fastest classical…
In this work we investigate lump-like solutions in models described by a single real scalar field. We start considering non-topological solutions with the usual lump-like form, and then we study other models, where the bell-shape profile…
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coincides with a classical complexity class called PP, or Probabilistic…
We consider optimization problems involving the multiplication of variable matrices to be selected from a given family, which might be a discrete set, a continuous set or a combination of both. Such nonlinear, and possibly discrete,…
For the rank regularized minimization problem, we introduce several kinds of stationary points by the problem itself and its equivalent reformulations including the mathematical program with an equilibrium constraint (MPEC), the global…
This paper presents a novel and straight formulation, and gives a complete insight towards the understanding of the complexity of the problems of the so called NP-Class. In particular, this paper focuses in the Searching of the Optimal…
This work provides a complete characterization of the solutions of a linear interpolation problem for vector polynomials. The interpolation problem consists in finding n scalar polynomials such that an equation involving a linear…
The $k$-subset sum problem over finite fields is a classical NP-complete problem.Motivated by coding theory applications, a more complex problem is the higher $m$-th moment $k$-subset sum problem over finite fields. We show that there is a…
Given a graph $G$, the NP-hard Maximum Planar Subgraph problem (MPS) asks for a planar subgraph of $G$ with the maximum number of edges. There are several heuristic, approximative, and exact algorithms to tackle the problem, but---to the…
We study bipartite maps on the plane with one infinite face and one face of perimeter 2. At first we consider the problem of their enumeration an then study the connection between the combinatorial structure of a map and the degree of its…
This article focuses on numerical efficiency of projection algorithms for solving linear optimization problems. The theoretical foundation for this approach is provided by the basic result that bounded finite dimensional linear optimization…
We consider the classical problem of invariant generation for programs with polynomial assignments and focus on synthesizing invariants that are a conjunction of strict polynomial inequalities. We present a sound and semi-complete method…
Consider the fundamental problem of drawing a simple random sample of size k without replacement from [n] := {1, . . . , n}. Although a number of classical algorithms exist for this problem, we construct algorithms that are even simpler,…
In general, the system of $2$nd-order partial differential equations made of the Euler-Lagrange equations of classical field theories are not compatible for singular Lagrangians. This is the so-called second-order problem. The first aim of…
This paper presents an iterative method suitable for inverting semilinear problems which are important kernels in many numerical applications. The primary idea is to employ a parametrization that is able to reduce semilinear problems into…
The fractional calculus of variations and fractional optimal control are generalizations of the corresponding classical theories, that allow problem modeling and formulations with arbitrary order derivatives and integrals. Because of the…
Analytical solutions to two axisymmetric problems of a penny-shaped crack when an annulus-shaped (model 1) or a disc-shaped (model 2) rigid inclusion of arbitrary profile are embedded into the crack are derived. The problems are governed by…
By exploiting the connection between solving algebraic $\top$-Riccati equations and computing certain deflating subspaces of $\top$-palindromic matrix pencils, we obtain theoretical and computational results on both problems. Theoretically,…