Related papers: The Wickstead Problem

A linked bar chart is the augmentation of a traditional bar chart where each bar is partitioned into blocks and pairs of blocks are linked using orthogonal lines that pass over intermediate bars. The order of the blocks readily influences…

Vector perturbation is an encoding method for broadcast channels in which the transmitter solves a shortest vector problem in a lattice to create a perturbation vector, which is then added to the data before transmission. In this work, we…

We give embedding theorems for weighted Bergman-Orlicz spaces on the ball and then apply our results to the study of composition operators in this context. As one of the motivations of this work, we show that there exist some weighted…

In recent years, questions about the construction of special orderings of a given graph search were studied by several authors. On the one hand, the so called end-vertex problem introduced by Corneil et al. in 2010 asks for search orderings…

We identify a new and important global (or non-binary) constraint. This constraint ensures that the values taken by two vectors of variables, when viewed as multisets, are ordered. This constraint is useful for a number of different…

The variation of spectral subspaces for linear self-adjoint operators under an additive bounded off-diagonal perturbation is studied. To this end, the optimization approach for general perturbations in [J. Anal. Math., to appear;…

In this article, we focus on extending the notion of lattice linearity to self-stabilizing programs. Lattice linearity allows a node to execute its actions with old information about the state of other nodes and still preserve correctness.…

In 2006, Arveson resolved a long-standing problem by showing that for any element $x$ of a separable self-adjoint unital subspace $S\subseteq B(H)$, $\|x\|=\sup\|\pi(x)\|$, where $\pi$ runs over the boundary representations for $S$. Here we…

In an Archimedean directed partially ordered vector space $X$ one can define the concept of a band in terms of disjointness. Bands can be studied by using a vector lattice cover $Y$ of $X$. If $X$ has an order unit, $Y$ can be represented…

We discuss a class of linear control problems in a Hilbert space setting. This class encompasses such diverse systems as port-Hamiltonian systems, Maxwell's equations with boundary control or the acoustic equations with boundary control and…

The Zygmund vector field maximal function conjecture is a long-standing open problem. This paper establishes a new boundedness criterion that significantly weakens the existing conditions in the literature. Specifically, the required decay…

There is a class of statistical problems that arises in several contexts, the Lattice QCD problem of particle physics being one that has attracted the most attention. In essence, the problem boils down to the estimation of an infinite…

Vertex operator approach is a powerful method to study exactly solvable models. We review recent progress of vertex operator approach to semi-infinite spin chain. (1) The first progress is a generalization of boundary condition. We study…

Let $\mathbf{k} := (k_1,\dots,k_s)$ be a sequence of natural numbers. For a graph $G$, let $F(G;\mathbf{k})$ denote the number of colourings of the edges of $G$ with colours $1,\dots,s$ such that, for every $c \in \{1,\dots,s\}$, the edges…

We consider a variable order differential operator on a graph with a cycle. We study the inverse spectral problem for this operator by the system of spectra. The main results of the paper are the uniqueness theorem and the constructive…

The Bandwidth Problem seeks for a simultaneous permutation of the rows and columns of the adjacency matrix of a graph such that all nonzero entries are as close as possible to the main diagonal. This work focuses on investigating novel…

The backwards diffusion equation is one of the classical ill-posed inverse problems, related to a wide range of applications, and has been extensively studied over the last 50 years. One of the first methods was that of {\it…

For operators representing ill-posed problems, an ordering by ill-posedness is proposed, where one operator is considered more ill-posed than another one if the former can be expressed as a cocatenation of bounded operators involving the…

In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…

Given a collection $L$ of line segments, we consider its arrangement and study the problem of covering all cells with line segments of $L$. That is, we want to find a minimum-size set $L'$ of line segments such that every cell in the…