Related papers: Homogeneous Cone Complementarity Problems and $P$ …

Let ${\mathscr P}$ be a topological property. We say that a space $X$ is ${\mathscr P}$-connected if there exists no pair $C$ and $D$ of disjoint cozero-sets of $X$ with non-${\mathscr P}$ closure such that the remainder $X\backslash(C\cup…

Given a simplicial complex with weights on its simplices, and a nontrivial cycle on it, we are interested in finding the cycle with minimal weight which is homologous to the given one. Assuming that the homology is defined with integer…

We consider an optimization problem with positively homogeneous functions in its objective and constraint functions. Examples of such positively homogeneous functions include the absolute value function and the $p$-norm function, where $p$…

Let $X$ be metrizable, $Y$ be perfectly normal and suppose that there exists a uniformly continuous surjection $T: C_{p}(X) \to C_{p}(Y)$ (resp., $T: C_{p}^*(X) \to C_{p}^*(Y)$), where $C_{p}(X)$ (resp., $C_{p}^*(X)$) denotes the space of…

We show that for any countable homogeneous ordered graph $G$, the conjugacy problem for automorphisms of $G$ is Borel complete. In fact we establish that each such $G$ satisfies a strong extension property called ABAP, which implies that…

Constraint satisfaction problems are computational problems that naturally appear in many areas of theoretical computer science. One of the central themes is their computational complexity, and in particular the border between…

We show that every non-degenerate homogeneous plane continuum is homeomorphic to either the unit circle, the pseudo-arc, or the circle of pseudo-arcs. It follows that any planar homogenous compactum has the form $X \times Z$, where $X$ is a…

The Promise Constraint Satisfaction Problem (PCSP for short) is a generalization of the well-studied Constraint Satisfaction Problem (CSP). The PCSP has its roots in such classic problems as the Approximate Graph Coloring and the…

We introduce the homogeneous and piecewise multilinear extensions and the eigenvalue problem for locally Lipschitz function pairs, in order to develop a systematic framework for relating discrete and continuous min-max problems. This also…

We present necessary and sufficient conditions for the termination of linear homogeneous programs. We also develop a complete method to check termination for this class of programs. Our complete characterization of termination for such…

A sequence of positive integers is complete if every positive integer is a sum of distinct terms. A positive linear recurrence sequence (PLRS) is a sequence defined by a homogeneous linear recurrence relation with nonnegative coefficients…

The NP-complete problem Matching Cut is to decide if a graph has a matching that is also an edge cut of the graph. We prove new complexity results for Matching Cut restricted to $H$-free graphs, that is, graphs that do not contain some…

In the paper the conditions are obtained providing existence and uniqueness of the regular solution of the boundary problem for class of the second order homogeneous operator-differential equation with singular coefficients. High term of…

This article is devoted to characterize all possible effective behaviors of composite materials by means of periodic homogenization. This is known as a $G$-closure problem. Under convexity and $p$-growth conditions ($p>1$), it is proved…

A binary matrix satisfies the consecutive ones property (COP) if its columns can be permuted such that the ones in each row of the resulting matrix are consecutive. Equivalently, a family of sets F = {Q_1,..,Q_m}, where Q_i is subset of R…

Let $k$ be a field of positive characteristic. Building on the work of the second named author, we define a new class of $k$-algebras, called diagonally $F$-regular algebras, for which the so-called Uniform Symbolic Topology Property (USTP)…

Designing scalable concurrent objects, which can be efficiently used on multicore processors, often requires one to abandon standard specification techniques, such as linearizability, in favor of more relaxed consistency requirements.…

We study the fluted fragment of first-order logic which is often viewed as a multi-variable non-guarded extension to various systems of description logics lacking role-inverses. In this paper we show that satisfiable fluted sentences (even…

We prove that a class of superlinear indefinite problems with homogeneous Neumann boundary conditions admits an arbitrarily high number of positive solutions, provided that the parameters of the problem are adequately chosen. The…

In this paper, we provide an elementary, geometric, and unified framework to analyze conic programs that we call the strict complementarity approach. This framework allows us to establish error bounds and quantify the sensitivity of the…