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

We describe two situations where adding the adjoint divisor to a divisor D with smooth normalization yields a free divisor. Both also involve stability or versality. In the first, D is the image of a corank one stable germ of a map from…

The $d$-independence number of a graph $G$ is the largest possible size of an independent set $I$ in $G$ where each vertex of $I$ has degree at least $d$ in $G$. Upper bounds for the $d$-independence number in planar graphs are well-known…

The $d$-plane transform maps functions to their integrals over $d$-planes in $\mathbb{R}^n$. We study the following question: if a function vanishes in a bounded open set, and its $d$-plane transform vanishes on all $d$-planes intersecting…

This paper gives a complete classification of linear repetitivity (LR) for a natural class of aperiodic Euclidean cut and project schemes with convex polytopal windows. Our results cover those cut and project schemes for which the lattice…

The band gap, a key concept in solid-state physics, is traditionally explained by the Bragg diffraction of electron waves in the periodic potential of a crystal. Although widely accepted, this framework raises fundamental issues in…

Differential structure of a d-dimensional lattice, which is essentially a noncommutative exterior algebra, is defined using reductions in first order and second order of universal differential calculus in the context of noncommutative…

In this note, we consider the space of all continuous operators with respect to the unbounded topology on locally solid vector lattices. We investigate whether this space forms a band. In addition, we look into some situations under which,…

Let $ D $ be a finite digraph, and let $ V_0,\dots,V_{k-1} $ be nonempty subsets of $ V(D) $. The (strong form of) Edmonds' branching theorem states thatthere are pairwise edge-disjoint spanning branchings $ \mathcal{B}_0,\dots,…

Suppose that for some unit vectors $b_1,\ldots b_n$ in $\mathbb C^d$ we have that for any $j\neq k$ $b_j$ is either orthogonal to $b_k$ or $|\langle b_j,b_k\rangle|^2 = 1/d$ (i.e. $b_j$ and $b_k$ are unbiased). We prove that if $n=d(d+1)$,…

We propose a linear independence criterion, and outline an application of it. Down to its simplest case, it aims at solving this problem: given three real numbers, typically as special values of analytic functions, how to prove that the…

The Riesz projection and the corresponding eigenfunction of a positive operator satisfying the Doeblin condition are explicitly constructed using the partial Bell polynomials. While classical Fredholm theory requires stringent summability…

We revisit the concept of a minimal basis through the lens of the theory of modules over a commutative ring $R$. We first review the conditions for the existence of a basis for submodules of $R^n$ where $R$ is a B\'{e}zout domain. Then, we…

A recent work by Lesnick and Wright proposed a visualisation of $2$D persistence modules by using their restrictions onto lines, giving a family of $1$D persistence modules. We give a constructive proof that any $1$D persistence module with…

In recent years, algebras and modules of differential operators have been extensively studied. Equivariant quantization and dequantization establish a tight link between invariant operators connecting modules of differential operators on…

We use methods from algebra and discrete geometry to study the irreducibility of the dispersion polynomial of a discrete periodic operator associated to a periodic graph after changing the period lattice. We provide numerous applications of…

This paper deals with lattices $(L,\Vert~\Vert)$ over polynomial rings, where $L$ is a finitely generated module over $k[t]$, the polynomial ring over the field $k$ in the indeterminate $t$, and $\Vert~\Vert$ is a discrete real-valued…

On a periodic planar graph whose edge weights satisfy a certain simple geometric condition, the discrete Laplacian and d-bar operators have the property that their determinants and inverses only depend on the local geometry of the graph. We…

In this Note we show that the notion of a basis of a finite-dimensional vector space could be introduced by an argument much weaker than Gauss' reduction method. Our aim is to give a short proof of a simply formulated lemma, which in fact…

In a seminal work, Micciancio & Voulgaris (2013) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus…

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…