相关论文: On the problem Ax=\lambda Bx in max algebra: every…

This paper is devoted to a new approach of the arithmetic of intervals. We present the set of intervals as a normed vector space. We define also a four-dimensional associative algebra whose product gives the product of intervals in any…

In this article we study higher homological properties of $n$-levelled algebras and connect them to properties of the underlying graphs. Notably, to each $2$-representation-finite quadratic monomial algebra $\Lambda$ we associate a…

We characterize the extreme points of the set of incentive-compatible mechanisms for screening problems with linear utility. Our framework subsumes problems with and without transfers, such as monopoly pricing, principal-optimal bilateral…

We study approximability of regular constraint satisfaction problems, i.e., CSPs where each variable in an instance has the same number of occurrences. In particular, we show that for any CSP $\Lambda$, existence of an $\alpha$…

This note further addresses the global optimization problem for max-plus linear systems considered in [Automatica 119 (2020) 109104]. Firstly, the operations between infinity elemens and real numbers involved in the formulas of solving…

We present a model for spectral theory of families of selfadjoint operators, and their corresponding unitary one-parameter groups (acting in Hilbert space.) The models allow for a scale of complexity, indexed by the natural numbers…

We show that any two frames in a separable Hilbert space that are dual to each other have the same excess. Some new relations for the analysis resp. synthesis operators of dual frames are also derived. We then prove that pseudo-dual frames…

We analyze the perturbation series for noncommutative eigenvalue problem $AX=X\lambda$ where $\lambda$ is an element of a noncommutative ring, $ A$ is a matrix and $X$ is a column vector with entries from this ring. As a corollary we obtain…

In this paper, we establish a couple of results on extremal problems in bipartite graphs. Firstly, we show that every sufficiently large bipartite graph with average degree $D$ and with $n$ vertices on each side has a balanced independent…

Consider $n$ linearly independent vectors in $\mathbb{C}^n$ which form columns of a matrix $A$. The recursive evaluation of eigen directions (normalized eigenvectors) of $A$ is the solution of an eigenvalue problem of the form…

The methods of the space syntax have been the subject of extensive discussion, and several techniques to identify the axis lines have been proposed. The space syntax can be represented in terms of line graph, a graphs defined on the edge of…

We ask whether the only multiplicities in the spectrum of the clamped round plate are trivial, i.e., whether all existing multiplicities are due to the isometries of the sphere, or, equivalently, whether any eigenfunction is separated. We…

Let $\Omega$ be an unbounded two dimensional strip on a ruled surface in $\mathbb{R}^d$, $d\geq2$. Consider the Laplacian operator in $\Omega$ with Dirichlet and Neumann boundary conditions on opposite sides of $\Omega$. We prove some…

For the Lagrange spectrum and other applications, we determine the smallest accumulation point of binary sequences that are maximal in their shift orbits. This problem is trivial for the lexicographic order, and its solution is the fixed…

The one-dimensional Hubbard model with open boundary conditions is exactly solved by means of algebraic Bethe ansatz. The eigenvalue of the transfer matrix, the energy spectrum as well as the Bethe ansatz equations are obtained.

There is a connection between *-representations of algebras associated with graphs and the problem about the spectrum of a sum of Hermitian operators (spectral problem). For algebras associated with extended Dynkin graphs we give an…

In this paper, based on some prior estimates, we show that the essential spectrum $\lambda=0$ is a bifurcation point for an superlinear elliptic equation with only local conditions, which generalizes a series of earlier results on an open…

A digraph X=(V, E) is max-\lambda, if \lambda(X)=\delta(X). A digraph X is super-\lambda if every minimum cut of X is either the set of inarcs of some vertex or the set of outarcs of some vertex. In this paper, we will prove that for all…

For $\mathbb N^*:=\mathbb N \setminus \{0\}$, we consider the collection $\mathfrak M(N)$ of all the $N$ rows, for which, for $n=1,\cdots,N$, the $n-th$ row consists of an increasing sequence $(a_j^n)_j$ of real numbers. For $\mathfrak A…

We describe all possible bimodal over-twist patterns. In particular, we give an algorithm allowing one to determine what the left endpoint of the over-rotation interval of a given bimodal map is. We then define a new class of polymodal…