相关论文: Designs for 24-vertex snarks

The problem of finding the sparsest vector (direction) in a low dimensional subspace can be considered as a homogeneous variant of the sparse recovery problem, which finds applications in robust subspace recovery, dictionary learning,…

The variation of spectral subspaces for linear self-adjoint operators under an additive bounded perturbation is considered. The objective is to estimate the norm of the difference of two spectral projections associated with isolated parts…

We consider the Degree-Bounded Survivable Network Design Problem: the objective is to find a minimum cost subgraph satisfying the given connectivity requirements as well as the degree bounds on the vertices. If we denote the upper bound on…

For a large class of linear neutral type systems the problem of eigenvalues and eigenvectors assignment is investigated, i.e. finding the system which has the given spectrum and almost all, in some sense, eigenvectors.

Network alignment consists of finding a structure-preserving correspondence between the nodes of two correlated, but not necessarily identical, networks. This problem finds applications in a wide variety of fields, from the alignment of…

We find an exact solution for multi-black strings in the brane world with warped compactification.

In this paper we further our understanding of the structure of class two cubic graphs, or snarks, as they are commonly known. We do this by investigating their 3-critical subgraphs, or as we will call them, minimal conflicting subgraphs. We…

Variable projection solves structured optimization problems by completely minimizing over a subset of the variables while iterating over the remaining variables. Over the last 30 years, the technique has been widely used, with empirical and…

Multipoles are the pieces we obtain by cutting some edges of a cubic graph. As a result of the cut, a multipole $M$ has dangling edges with one free end, which we call semiedges. Then, every 3-edge-coloring of a multipole induces a coloring…

This article introduces an innovative mathematical framework designed to tackle non-linear convex variational problems in reflexive Banach spaces. Our approach employs a versatile technique that can handle a broad range of variational…

We define the dart $D(a)$ to be the nonconvex quadrilateral whose vertices are $(0,1), (1,1), (1,0), (a,a)$ (in counterclockwise order), with $a>1$. Such a dart can be dissected into any even number of equal-area triangles. Here we…

We use super-spectral curve to investigate irregular conformal states of integer and half-odd integer rank. The spectral curve is the loop equation of supersymmetrized irregular matrix model. The case of integer rank corresponds to the…

We address the question of whether it may be worthwhile to convert certain, now classical, NP-complete problems to one of a smaller number of kernel NP-complete problems. In particular, we show that Karp's classical set of 21 NP-complete…

We discuss the generalization of recently discovered BPS configurations, corresponding to the planar string networks, to non-planar ones by considering the U-duality symmetry of type II string theory in various dimensions. As an explicit…

We consider a control problem for longitudinal vibrations of a nonhomogeneous bar with clamped ends. The vibrations of the bar are controlled by an external force which is distributed along the bar. For the minimization problem of mean…

We study the computational complexity of two well-known graph transversal problems, namely Subset Feedback Vertex Set and Subset Odd Cycle Transversal, by restricting the input to $H$-free graphs, that is, to graphs that do not contain some…

The research area of Networked Control Systems (NCS) has been the topic of intensive study in the last decade. In this paper we give a contribution to this research line by addressing symbolic control design of (possibly unstable) nonlinear…

Work on different classification problems is described as: the classification of integrable vector evolution equations, NLS systems with two vector unknowns, systems with one scalar and one vector unknown, classification of integrable…

The non-convex quadratic orogramming problem and the non-monotone linear complementarity problem are NP-complete problems. In this paper we first show taht the inverse problem of determinning a KKT point of the non-convex quadratic…

In this article we study domino snake problems on finitely generated groups. We provide general properties of these problems and introduce new tools for their study. The first is the use of symbolic dynamics to understand the set of all…