Related papers: d-independence and d-bases in vector lattices

When all non-edge distances of a graph realized in $\mathbb{R}^{d}$ as a {\em bar-and-joint framework} are generically {\em implied} by the bar (edge) lengths, the graph is said to be {\em rigid} in $\mathbb{R}^{d}$. For $d=3$,…

An important result in real algebraic geometry is the projection theorem: every projection of a semialgebraic set is again semialgebraic. This theorem and some of its conclusions lie at the basis of many other results, for example the…

Here we study the problem of generalizing one of the main tools of Groebner basis theory, namely the flat deformation to the leading term ideal, to the border basis setting. After showing that the straightforward approach based on the…

Let $T$ be a self-adjoint operator in a Hilbert space $H$ with domain $\mathcal D(T)$. Assume that the spectrum of $T$ is confined in the union of disjoint intervals $\Delta_k =[\alpha_{2k-1},\alpha_{2k}]$, $k\in \mathbb{Z}$, and $$…

A D-polyhedron is a polyhedron $P$ such that if $x,y$ are in $P$ then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive lattice with the dominance order. We provide a full…

In this paper we explore the concept of locally band preserving functions, introduced by Ercan and Wickstead, on Dedekind complete $\Phi$-algebras. Specifically, we show that all super order differentiable functions are locally band…

We consider the bond percolation model on the lattice $\mathbb{Z}^d$ ($d\ge 2$) with the constraint to be fully connected. Each edge is open with probability $p\in(0,1)$, closed with probability $1-p$ and then the process is conditioned to…

We give an explicit description of the lattice $\Semistar(D)$ of all semistar operations on any Dedekind domain $D$ from its set $\Max(D)$ of maximal ideals. This descpription is constructive if $\Max(D)$ is finite. As a corollary we show…

Dependency analysis is vital to several applications in computer science. It lies at the essence of secure information flow analysis, binding-time analysis, etc. Various calculi have been proposed in the literature for analysing individual…

A graph is called $d$-rigid if there exists a generic embedding of its vertex set into $\mathbb{R}^d$ such that every continuous motion of the vertices that preserves the lengths of all edges actually preserves the distances between all…

By using some lattice-like operations which constitute extensions of ones introduced by M. S. Gowda, R. Sznajder and J. Tao for self-dual cones, a new perspective is gained on the subject of isotonicity of the metric projection onto the…

Although every exactly known bond percolation critical threshold is the root in $[0,1]$ of a lattice-dependent polynomial, it has recently been shown that the notion of a critical polynomial can be extended to any periodic lattice. The…

We propose a new prescription of how to represent D-branes in Gepner models in more general homology classes than those in the previous constructions. The central role is played by a certain projection acting on the Recknagel-Schomerus…

Let $E$ and $F$ be Banach lattices. We show first that the disjointness preserving linear functionals separate the points of any infinite dimensional Banach lattice $E$, which shows that in this case the unbounded disjointness operators…

We study the R-torsionfree part of the Ziegler spectrum of an order \Lambda over a Dedekind domain R. We underline and comment on the role of lattices over \Lambda. We describe the torsionfree part of the spectrum when \Lambda is of finite…

We consider one possible definition of a diffeological connection on a diffeological vector pseudo-bundle. It is different from the one proposed in [7] and is in fact simpler, since it is obtained by a straightforward adaption of the…

A lattice reduction is an algorithm that transforms the given basis of the lattice to another lattice basis such that problems like finding a shortest vector and closest vector become easier to solve. We define a class of bases called…

This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…

This paper deals with the problem of describing the vector spaces of divergence-free, natural tensors on a pseudo-Riemannian manifold that are second-order; i.e., that are defined using only second derivatives of the metric. The main result…

Formal Laplace operators are analyzed for a large class of resistance networks with vertex weights. The graphs are completed with respect to the minimal resistance path metric. Compactness and a novel connectivity hypothesis for the…