相关论文: Extending Mappings between Posets
The interleaving distance, although originally developed for persistent homology, has been generalized to measure the distance between functors modeled on many posets or even small categories. Existing theories require that such a poset…
We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving…
A nonlinear inequality is formulated in the paper. An estimate of the rate of decay of solutions to this inequality is obtained. This inequality is of interest in a study of dynamical systems and nonlinear evolution equations. It can be…
In this short note we give incremental algorithms for the following lattice problems: finding a basis of a lattice, computing the successive minima, and determining the orthogonal decomposition. We prove an upper bound for the number of…
By setting up appropriate uniform convergence structures, we are able to reformulate the Order Completion Method of Oberguggenberger and Rosinger in a setting that more closely resembles the usual topological constructions for solving PDEs.…
Sign imbalance is a statistic on posets which counts the difference between the number of even and odd linear extensions. We prove complexity results about the sign imbalance and parity of linear extensions, focusing on the representative…
We extend the results of arXiv:1808.01509 on nonamalgamable forcing extensions to families of posets with wide projections. We also use a different coding method to obtain nonamalgamable extensions by filter-based Mathias forcing.
As it is well-known, Poisson brackets play a fundamental role both in mechanics and in classical field theories. In this paper we develop a theory of extensions of graded Poisson brackets in graded Dirac manifolds. We then show how these…
This article is devoted to the study of mappings defined in the region on the plane. Under certain conditions, the upper estimate of the distortion of the modulus of families of paths is obtained. Similarly, the upper estimate of the…
The minimum number of elements needed for a poset to have exactly n linear extensions is at most 2sqrt{n}. In a special case, the bound can be improved to sqrt{n}.
We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases.…
It was recently shown that arbitrary first-order models canonically extend to models (of the same language) consisting of ultrafilters. The main precursor of this construction was the extension of semigroups to semigroups of ultrafilters, a…
Contrary to widespread perception, there is ever since 1994 a unified, general type independent theory for the existence of solutions for very large classes of nonlinear systems of PDEs. This solution method is based on the Dedekind order…
Given a finite poset P, we consider pairs of linear extensions of P with maximal distance, where the distance between two linear extensions L_1, L_2 is the number of pairs of elements of P appearing in different orders in L_1 and L_2. A…
Given a complemented poset P, we can assign to every element x of P the set x^+ of all its complements. We study properties of the operator ^+ on P, in particular, we are interested in the case when x^+ forms an antichain or when ^+ is…
We introduce so-called consistent posets which are bounded posets with an antitone involution ' where the lower cones of x,x' and of y,y' coincide provided x,y are different form 0,1 and, moreover, if x,y are different form 0 then their…
We introduce an alternative to the method of matched asymptotic expansions. In the "traditional" implementation, approximate solutions, valid in different (but overlapping) regions are matched by using "intermediate" variables. Here we…
We define toric partial orders, corresponding to regions of graphic toric hyperplane arrangements, just as ordinary partial orders correspond to regions of graphic hyperplane arrangements. Combinatorially, toric posets correspond to finite…
It is shown how to define difference equations on particular lattices $\{x_n\}$, $n\in\mathbb{Z}$, made of values of an elliptic function at a sequence of arguments in arithmetic progression (elliptic lattice). Solutions to special…
In this paper we extend the construction of the Niemytzki plane to dimension $n \geq 3$. Further, we consider a poset of topologies on the closed $n$-dimensional Euclidean half-space similar to one from \cite{AAK} which is related to the…