Related papers: An NP-hardness Result on the Monoid Frobenius Prob…
In this paper, we prove the problem of stabbing a set of disjoint bends by a convex stabber to be NP-hard. We also consider the optimization version of the convex stabber problem and prove this problem to be APX-hard for sets of line…
Selection of 25 examples from extensive nontrivial families for different types of nonlinear PDEs and their formal general solutions are given. The main goal here is to show on examples the types of solvable PDEs and what their general…
We prove $\textsf{NP-hardness}$ results for determining whether quivers are mutation equivalent to quivers with given properties. Specifically, determining whether a quiver is mutation-equivalent to a quiver with exactly $k$ arrows between…
Several N-body problems in ordinary (3-dimensional) space are introduced which are characterized by Newtonian equations of motion (``acceleration equal force;'' in most cases, the forces are velocity-dependent) and are amenable to exact…
The 1-in-3 and Not-All-Equal satisfiability problems for Boolean CNF formulas are two well-known NP-hard problems. In contrast, the promise 1-in-3 vs. Not-All-Equal problem can be solved in polynomial time. In the present work, we…
Our main result is a succinct counterpoint to Courcelle's meta-theorem as follows: every cw-nontrivial monadic second-order (MSO) property is either NP-hard or coNP-hard over graphs given by succinct representations. Succint representations…
Consider the equation $q_1\alpha^{x_1}+\dots+q_k\alpha^{x_k} = q$, with constants $\alpha \in \overline{\mathbb{Q}} \setminus \{0,1\}$, $q_1,\ldots,q_k,q\in\overline{\mathbb{Q}}$ and unknowns $x_1,\ldots,x_k$, referred to in this paper as…
Decision-theoretic troubleshooting is one of the areas to which Bayesian networks can be applied. Given a probabilistic model of a malfunctioning man-made device, the task is to construct a repair strategy with minimal expected cost. The…
This article presents a technique for proving problems hard for classes of the polynomial hierarchy or for PSPACE. The rationale of this technique is that some problem restrictions are able to simulate existential or universal quantifiers.…
In this paper we investigate computational properties of the Diophantine problem for spherical equations in some classes of finite groups. We classify the complexity of different variations of the problem, e.g., when $G$ is fixed and when…
The planar Kepler problem is complexified and we show that this holomorphic completely integrable Hamiltonian system has nontrivial monodromy.
We show that a perturbed Coulomb problem discussed recently is conditionally solvable. We obtain the exact eigenvalues and eigenfunctions and compare the former with eigenvalues calculated by means of a numerical method. We discuss the…
Let $X$ be a smooth proper variety of even dimension $d$ over a finite field. We establish a restriction on the value at $(-1)$ of the characteristic polynomial of the Frobenius on the middle-dimensional \'etale cohomology of $X$ with…
A countable discrete group is said to be Frobenius stable if every function from the group to unitary matrices that is "almost multiplicative" in the Frobenius norm is "close" to a unitary representation in the Frobenius norm. The purpose…
We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…
If a nontrivial finite group coacts on a graded noetherian down-up algebra $A$ inner faithfully and homogeneously, then the fixed subring is not isomorphic to $A$. Therefore graded noetherian down-up algebras are rigid with respect to…
A matching is a set of edges in a graph with no common endpoint. A matching M is called acyclic if the induced subgraph on the endpoints of the edges in M is acyclic. Given a graph G and an integer k, Acyclic Matching Problem seeks for an…
A regular realizability (RR) problem is testing nonemptiness of intersection of some fixed language (filter) with given regular language. We study here complexity of RR problems. It appears that for any language L there exists RR problem…
Let F be a homogeneous real polynomial of even degree in any number of variables. We consider the problem of giving explicit conditions on the coefficients so that F is positive definite or positive semi-definite. In this note we produce a…
We study the homotopy fixed points under the Frobenius endomorphism on the stable $\mathbb A^1$-homotopy category of schemes in characteristic $p>0$ and prove a rigidity result for cellular objects in these categories after inverting $p$.…