Related papers: Bipolarization of posets and natural interpolation
It is shown that polar codes achieve the symmetric capacity of discrete memoryless channels with arbitrary input alphabet sizes. It is shown that in general, channel polarization happens in several, rather than only two levels so that the…
We introduce and investigate classes of normed or quasinormed distribution spaces of generalized smoothness that can be obtained by various interpolation methods applied to classical Sobolev, Nikolskii-Besov, and Triebel-Lizorkin spaces. An…
This paper considers the planar figure of a combinatorial polytope or tessellation identified by the Coxeter symbol $k_{i,j}$ , inscribed in a conic, satisfying the geometric constraint that each octahedral cell has a centre. This…
A chain poset, by definition, consists of chains of ordered elements in a poset. We study the chain posets associated to two posets: the Boolean algebra and the poset of isotropic flags. We prove that, in both cases, the chain posets…
We show that every operator system (and hence every unital operator algebra) has sufficiently many boundary representations to generate the C*-envelope.
We consider a bivariate polynomial that generalizes both the length and reflection length generating functions in a finite Coxeter group. In seeking a combinatorial description of the coefficients, we are led to the study of a new Mahonian…
Using invariants from commutative algebra to count geometric objects is a basic idea in singularities. For example, the multiplicity of an ideal is used to count points of intersection of two analytic sets at points of non-transverse…
Well-partial orders, and the ordinal invariants used to measure them, are relevant in set theory, program verification, proof theory and many other areas of computer science and mathematics. In this article we focus on one of the most…
We introduce posets with interfaces (iposets) and generalise their standard serial composition to a new gluing composition. In the partial order semantics of concurrency, interfaces and gluing allow modelling events that extend in time and…
Many systems of interest to control engineering can be modeled by linear complementarity problems. We introduce a new notion of equivalence between linear complementarity problems that sets the basis to translate the powerful tools of…
The present work proposes the concept of induced percolation over multiple-object systems, so that features such as the number of merged clusters can be used as a relevant measurement. The suggested approach involves the expansion of the…
A causal set is a countably infinite poset in which every element is above finitely many others; causal sets are exactly the posets that have a linear extension with the order-type of the natural numbers -- we call such a linear extension a…
We associate bicomplexes with several integrable models in such a way that conserved currents are obtained by a simple iterative construction. Gauge transformations and dressings are discussed in this framework and several examples are…
In addition to the three standard operations on posets which are dual of poset or ordinal and cardinal sums of partial ordered sets one adds the natural join of posets. This is especially natural natural join operation for graded posets…
The system of cavity polaritons driven by a plane electromagnetic wave is found to undergo the spontaneous breaking of spatial symmetry, which results in a lifted phase locking with respect to the driving field and, consequently, in the…
The theory of pictures between posets is known to encode much of the combinatorics of symmetric group representations and related topics such as Young diagrams and tableaux. Many reasons, com-binatorial (e.g. since semi-standard tableaux…
In this paper we present an efficient algorithm for bivariate interpolation, which is based on the use of the partition of unity method for constructing a global interpolant. It is obtained by combining local radial basis function…
We initiate the study of model structures on (categories induced by) lattice posets, a subject we dub homotopical combinatorics. In the case of a finite total order $[n]$, we enumerate all model structures, exhibiting a rich combinatorial…
We define and study a class of finite topological spaces, which model the cell structure of a space obtained by gluing finitely many Euclidean convex polyhedral cells along congruent faces. We call these finite topological spaces,…
To every poset P, Stanley (1986) associated two polytopes, the order polytope and the chain polytope, whose geometric properties reflect the combinatorial qualities of P. This construction allows for deep insights into combinatorics by way…