Related papers: Smallest order closed sublattices and option spann…
We study a model of random electric networks with Bernoulli resistances. In the case of the lattice Z^2, we show that the point-to-point effective resistance between 0 and a vertex v has a variance of order at most (log |v|)^(2/3) whereas…
In this paper we introduce a new semicontinuity notion, which is weaker than upper semicontinuity, and assures the closedness of the sets $G(y)=\{x\in K: f(x,y)\not\in -\inte C\}.$ Furhter, this semicontinuity is also closed under addition.…
We investigate the definability (reducts) lattice of the order of integers and describe a sublattice generated by relations 'between', 'cycle', 'separation', 'neighbor', '1-codirection', 'order' and equality'. Some open questions are…
We consider the minimum spanning tree problem with predictions, using the weight-arrival model, i.e., the graph is given, together with predictions for the weights of all edges. Then the actual weights arrive one at a time and an…
A topological space $X$ is called resolvable if it contains a dense subset with dense complement. Using only basic principles, we show that whenever the space $X$ has a resolving subset that can be written as an at most countably infinite…
For a non-empty set $X$, the collection $Top(X)$ of all topologies on $X$ sits inside the Boolean lattice $\PP(\PP(X))$ (when ordered by set-theoretic inclusion) which in turn can be naturally identified with the Stone space $\px$. Via this…
Spanners, emulators, and approximate distance oracles can be viewed as lossy compression schemes that represent an unweighted graph metric in small space, say $\tilde{O}(n^{1+\delta})$ bits. There is an inherent tradeoff between the…
Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…
A labelled, undirected graph is a graph whose edges have assigned labels, from a specific set. Given a labelled, undirected graph, the well-known minimum labelling spanning tree problem is aimed at finding the spanning tree of the graph…
Various embedding problems of lattices into complete lattices are solved. We prove that for any join-semilattice S with the minimal join-cover refinement property, the ideal lattice IdS of S is both algebraic and dually algebraic.…
The main result of the paper is an extension of the Dirichlet problem from (closures of) bounded open domains U to arbitrary compact subsets X of the complex plane, i.e. the closure of the corresponding space of functions which are harmonic…
The following dichotomy is established for a normalized weakly null sequence in a Banach space: Either every subsequence admits a convex block subsequence equivalent to the unit vector basis of c, the Banach space of null sequences under…
Subexponential logic is a variant of linear logic with a family of exponential connectives--called subexponentials--that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening…
The Minimum Branch Vertices Spanning Tree problem aims to find a spanning tree $T$ in a given graph $G$ with the fewest branch vertices, defined as vertices with a degree three or more in $T$. This problem, known to be NP-hard, has…
If a knot has the Alexander polynomial not equal to 1, then it is linear $n$-colorable. By means of such a coloring, such a knot is given an upper bound for the minimal quandle order, i.e., the minimal order of a quandle with which the knot…
This paper introduces statistical order convergence and its pointwise variant for sequences of order bounded operators between Riesz spaces. We establish fundamental properties: uniqueness of the limit, stability under lattice operations,…
Several recent papers investigated unbounded versions of order and norm convergences in Banach lattices. In this paper, we study the unbounded variant of weak convergence and its relationship with other convergences. In particular, we…
In this paper, we elaborate ring theoretic properties of nodal orders. In particular, we prove that they are closed under taking crossed products with finite groups.
Suppose $E$ is a Banach lattice. Recently, there have been some motivating contexts regarding the known Banach-Saks property and the Grothendieck property from an order point of view. In this paper, we establish these results for operators…
In this paper, we introduce the concept of a pseudo weakly compact operator of order $ p $ between Banach spaces. Also we study the notion of $ p $-Dunford-Pettis relatively compact property which is in "general" weaker than the…