Related papers: Homogeneous Cone Complementarity Problems and $P$ …
Linear complementarity problems are a powerful tool for modeling many practically relevant situations such as market equilibria. They also connect many sub-areas of mathematics like game theory, optimization, and matrix theory. Despite…
We develop a framework that systematically casts the solvability and uniqueness conditions of linearized geometric boundary-value problems into cohomological terms. The theory is designed to be applicable without assumptions on the…
We prove existence and uniqueness for solutions to equilibrium problems for free-standing, traction-free, non homogeneous crystals in the presence of plastic slips. Moreover we prove that this class of problems is closed under G-convergence…
We develop the viscosity method for the homogenization of an obstacle problem with highly oscillating obstacles. The associated operator, in non-divergence form, is linear and elliptic with variable coefficients. We first construct a highly…
In this paper, we introduce a unified framework of Tensor Higher-Degree Eigenvalue Complementarity Problem (THDEiCP), which goes beyond the framework of the typical Quadratic Eigenvalue Complementarity Problem (QEiCP) for matrices. First,…
By setting up appropriate uniform convergence structures, we are able to reformulate the Order Completion Method of Oberguggenberger and Rosinger in a setting that more closely resembles the usual topological constructions for solving PDEs.…
Homogenization is a powerful way of taming a class of finite structures with several interesting applications in different areas, from Ramsey theory in combinatorics to constraint satisfaction problems (CSPs) in computer science, through…
A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers where this homomorphism is prescribed by the action of a semiregular subgroup of $\textrm{Aut}(G)$. We study…
In this paper we are interested in the fine-grained complexity of deciding whether there is a homomorphism from an input graph $G$ to a fixed graph $H$ (the $H$-Coloring problem). The starting point is that these problems can be viewed as…
In this work, we investigate the qualitative properties as uniqueness, regularity and stabilization of the weak solution to the nonlinear parabolic problem involving general $p(x)$-homogeneous operators: \begin{equation*} \left\{…
In this paper we investigate homogenization results for the principal eigenvalue problem associated to $1$-homogeneous, uniformly elliptic, second-order operators. Under rather general assumptions, we prove that the principal eigenpair…
Quadratic eigenvalue problems (QEP) and more generally polynomial eigenvalue problems (PEP) are among the most common types of nonlinear eigenvalue problems. Both problems, especially the QEP, have extensive applications. A typical approach…
In this paper, we consider the problem of minimizing a general homogeneous quadratic function, subject to three real or four complex homogeneous quadratic inequality or equality constraints. For this problem, we present a sufficient and…
Using the T-algebra machinery we show that, up to linear isomorphism, the only strictly convex homogeneous cones in $\Re^n$ with $n \geq 3$ are the 2-cones, also known as Lorentz cones or second order cones. In particular, this shows that…
Graph modification problems are computational tasks where the goal is to change an input graph $G$ using operations from a fixed set, in order to make the resulting graph satisfy a target property, which usually entails membership to a…
This paper is devoted to the study of uniform $W^{1,\frac{np}{n-p}}$- and $W^{2,p}$-estimates for viscosity solutions to fully nonlinear, uniformly elliptic, periodic homogenization problems, up to boundaries, subject to Dirichlet boundary…
This paper establishes a fundamental and surprising phenomenon in the theory of stochastic wave equations: the restoration of the unique continuation property (UCP) across characteristic hypersurfaces, a property that is known to fail…
A perfect structure is a triple $(M,P,S)$ of matrices $M, P$ and $S$ of consistent sizes such that $MP = PS$. Perfect structures comprise similar matrices, eigenvectors, perfect colorings (equitable partitions) and graph coverings. In this…
Proving the NP-completeness of pencil-and-paper puzzles typically relies on reductions from combinatorial problems such as the satisfiability problem (SAT). Although the properties of these problems are well studied, their purely…
The properties of the evolution equation have been analyzed. The uniqueness and the existence of solution for the evolution equation with special value of parameter characterizing intensity of change of external conditions, of the…