Related papers: Posets with Interfaces as a Model for Concurrency

We give a completely formalized definition of a notion of " general manifold ". It turns out that " gluing data " form an equivalence-partially ordered set (e-pos), which is a special instance of an ordered groupoid. We state and prove…

Recently, there is growing interest in the use of relative homology algebra to develop invariants using interval covers and interval resolutions (i.e., right minimal approximations and resolutions relative to interval-decomposable modules)…

Decomposition spaces are a class of function spaces constructed out of well-behaved coverings and partitions of unity of a set. The structure of the covering of the set determines the properties of the decomposition space. Besov spaces,…

With a model of a geometric theory in an arbitrary topos, we associate a site obtained by endowing a category of generalized elements of the model with a Grothendieck topology, which we call the antecedent topology. Then we show that the…

The manuscript discusses a well-known issue that, despite its fundamental role in basic electric circuit theory, seems to be tackled without the needful attention. The question if the Principle of Superposition (POS) can be applied to…

We consider hyperplane arrangements generated by generic points and study their intersection lattices. These arrangements are known to be equivalent to discriminantal arrangements. We show a fundamental structure of the intersection…

An accurate implicit description of geometries is enabled by the level-set method. Level-set data is given at the nodes of a higher-order background mesh and the interpolated zero-level sets imply boundaries of the domain or interfaces…

This paper aims to undertake an exploration of the behavior of the moduli space of line arrangements while establishing its combinatorial interplay with the incidence structure of the arrangement. In the first part, we investigate…

We present a high order immersed finite element (IFE) method for solving the elliptic interface problem with interface-independent meshes. The IFE functions developed here satisfy the interface conditions exactly and they have optimal…

In this paper we give an algorithm to determine, for any given suborder closed class of series-parallel posets, a structure theorem for the class. We refer to these structure theorems as structural descriptions.

The intersection data of a hyperplane arrangement is described by a geometric lattice, or equivalently a simple matroid. There is a rich interplay between this combinatorial structure and the topology of the arrangement complement. In this…

In order to be able to use methods of Universal Algebra for investigating posets, we assign to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset a certain algebra…

In 1986 Stanley associated to a poset the order polytope. The close interplay between its combinatorial and geometric properties makes the order polytope an object of tremendous interest. Double posets were introduced in 2011 by Malvenuto…

In this paper we describe a novel a procedure to build a linear order from an arbitrary poset which (i) preserves the original ordering and (ii) allows to extend monotonic and antitonic mappings defined over the original poset to monotonic…

We study a certain poset on the free monoid on a countable alphabet. This poset is determined by the fact that its total extensions are precisely the standard term orders. We also investigate the poset classifying degree-compatible standard…

This article presents new immersed finite element (IFE) methods for solving the popular second order elliptic interface problems on structured Cartesian meshes even if the involved interfaces have nontrivial geometries. These IFE methods…

This paper presents combinatorial facts dealing with the number of unlabeled partially ordered sets (posets) refined by the number of arcs in the Hasse diagram (sequence A342447 in OEIS). The main result is that the differences with respect…

In subspace clustering, a group of data points belonging to a union of subspaces are assigned membership to their respective subspaces. This paper presents a new approach dubbed Innovation Pursuit (iPursuit) to the problem of subspace…

This paper provides a nonparametric analysis for several classes of models, with cases such as classical measurement error, regression with errors in variables, factor models and other models that may be represented in a form involving…

From descent theory to higher geometry, the idea of gluing has been embedded in many elegant and powerful techniques, proving instrumental for the solution of many problems. In this paper, we introduce a framework that allows to link…