Related papers: Total orderization invariant maps on distributive …
We consider the lattice of all the weak factorization systems on a given finite lattice. We prove that it is semidistributive, trim and congruence uniform. We deduce a graph theoretical approach to the problem of enumerating transfer…
We develop a theory of minors for alternating dimaps --- orientably embedded digraphs where, at each vertex, the incident edges (taken in the order given by the embedding) are directed alternately into, and out of, the vertex. We show that…
Inspired by a twist maps theorem of Mather we study recurrent invariant sets that are ordered like rigid rotation under the action of the lift of a bimodal circle map $g$ to the $k$-fold cover. For each irrational in the interior of the…
Probability maps are additive and normalised maps taking values in the unit interval of a lattice ordered Abelian group. They appear in theory of affine representations and they are also a semantic counterpart of Hajek's probability logic.…
Generalizing de Vries Compactification Theorem and strengthening Leader Local Compactification Theorem, we describe the partially ordered set $(\LL(X),\le)$ of all (up to equivalence) locally compact Hausdorff extensions of a Tychonoff…
We consider distributions on a closed compact manifold $M$ as maps on smoothing operators. Thus spaces of certain maps between $\Psi^{-\infty}(M)\to \mathcal{C}^{\infty}(M)$ are considered as generalized functions. For any collection of…
Automorphisms of finite order and real forms of "smooth" affine Kac-Moody algebras are studied, i.e. of 2-dimensional extensions of the algebra of smooth loops in a simple Lie algebra. It is shown that they can be parametrized by certain…
Can the behavior of a random matrix be improved by modifying a small fraction of its entries? Consider a random matrix $A$ with i.i.d. entries. We show that the operator norm of $A$ can be reduced to the optimal order $O(\sqrt{n})$ by…
We introduce a canonical operator-theoretic construction associated to a finite geometric lattice, in which a simple nonassociative ``diamond product'' on the lattice basis gives rise to a family of creation operators indexed by atoms and a…
It is well known that over an infinite field the ring of symmetric functions in a finite number of variables is isomorphic to the one of polynomial functions on matrices that are invariants by the action of conjugation by general linear…
We prove that every ordered partial action of an inverse semigroupoid on a partially ordered set admits a globalization. This result is used to establish a connection between ordered partial actions of groupoids and a multi-object analogue…
Given an endomorphism A over a finite dimensional vector space having Jordan-Chevalley decomposition, the lattices of invariant and hyperinvariant subspaces of A can be obtained from the nilpotent part of this decomposition. We extend this…
Let $X_1, X_2,\ldots, X_n$ (resp. $Y_1, Y_2,\ldots, Y_n$) be independent random variables such that $X_i$ (resp. $Y_i$) follows generalized exponential distribution with shape parameter $\theta_i$ and scale parameter $\lambda_i$ (resp.…
In this paper, vector optimization is considered in the framework of decision making and optimization in general spaces. Interdependencies between domination structures in decision making and domination sets in vector optimization are…
Defant and Kravitz introduced generalizations of West's stack-sorting map $s$ from permutations to finite words. This raises questions as to how such generalizations could be applied in the field of combinatorics on words. The…
Restrictions of incidence-preserving path maps produce an oriented hypergraphic All Minors Matrix-tree Theorems for Laplacian and adjacency matrices. The images of these maps produce a locally signed graphic, incidence generalization, of…
We resume the results from \cite{Vershik FA} on the classification of measurable functions in several variables, with some minor corrections of purely technical nature, and give a partial solution to the characterization problem of…
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…
Although inverse limits with factor spaces indexed by the positive integers are most commonly studied, Ingram and Mahavier have defined inverse limits with set-valued functions broadly enough for any directed index set to be used. In this…
This is the first one of a series of papers on association of orientations, lattice polytopes, and abelian group arrangements to graphs. The purpose is to interpret the integral and modular tension polynomials of graphs at zero and negative…