Related papers: The expected jaggedness of order ideals
The purpose of this paper is to establish the almost sure weak ergodic convergence of a sequence of iterates $(x_n)$ given by $x_{n+1} = (I+\lambda_n A(\xi_{n+1},\,.\,))^{-1}(x_n)$ where $(A(s,\,.\,):s\in E)$ is a collection of maximal…
A finite poset (partially ordered set) $P$ with ${\hat 0}$ is called of distributive type if every interval $[{\hat 0}, a]$, $a \in P$, of $P$ is a distributive lattice. From a viewpoint of ASL's (algebras with straightening laws), the…
A general piecewise (including pointwise) probability distribution with space-saving notation and its hierarchical particular cases are considered. The explicit closed-form normalization, expectation, and variance formulas along with the…
Rowmotion is a simple cyclic action on the distributive lattice of order ideals of a poset: it sends the order ideal x to the order ideal generated by the minimal elements not in x. It can also be computed in "slow motion" as a sequence of…
Consider an ordered point set $P = (p_1,\ldots,p_n)$, its order type (denoted by $\chi_P$) is a map which assigns to every triple of points a value in $\{+,-,0\}$ based on whether the points are collinear(0), oriented clockwise(-) or…
In this paper, we firstly character the structures of symmetries $J$ such that a projection $P$ is $J$-contractive. Then the minimal and maximal elements of the symmetries $J$ with $P^{\ast}JP\leqslant J$(or $JP\geqslant0)$ are given.…
Let alpha = (a,b,...) be a composition. Consider the associated poset F(alpha), called a fence, whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... . We study the associated distributive…
We prove several Littlewood-Offord type inequalities for arbitrary groups. In groups having elements of finite order the worst case scenario is provided by the simple random walk on a certain cyclic subgroup. The inequalities we obtain are…
We define an inhomogeneous percolation model on "ladder graphs" obtained as direct products of an arbitrary graph $G = (V,E)$ and the set of integers $\mathbb{Z}$ (vertices are thought of as having a "vertical" component indexed by an…
Given a conditional expectation $P$ from a C*-algebra $B$ onto a C*-subalgebra $A$, we observe that induction of ideals via $P$, together with a map which we call co-induction, forms a Galois connection between the lattices of ideals of $A$…
A Poisson algebra $\Bbb C[G]$ considered as a Poisson version of the twisted quantized coordinate ring $\Bbb C_{q,p}[G]$, constructed by Hodges, Levasseur and Toro in \cite{HoLeT}, is obtained and its Poisson structure is investigated. This…
The behavior of the images of a fixed element of order p in irreducible representations of a classical algebraic group in odd characteristic p with highest weights large enough with respect to p and this element is investigated. Lower…
A basic problem in the theory of partially ordered vector spaces is to characterise those cones on which every order-isomorphism is linear. We show that this is the case for every Archimedean cone that equals the inf-sup hull of the sum of…
We say that an ideal I is homogeneous, if its restriction to any I-positive subset is isomorphic to I. The paper investigates basic properties of this notion -- we give examples of homogeneous ideals and present some applications to…
A symmetric chain of ideals is a rule that assigns to each finite set $S$ an ideal $I_S$ in the polynomial ring $\mathbb{C}[x_i]_{i \in S}$ such that if $\phi \colon S \to T$ is an embedding of finite sets then the induced homomorphism…
In this article, we first generalize Kaplansky's zero-divisor conjecture of group-rings $K[G]$ (with $K$ a field) to the more general setting of $G$-graded rings $R=\bigoplus\limits_{n\in G}R_{n}$ with $G$ a torsion-free group. Then we…
We consider Bayesian estimation of a $p\times p$ precision matrix, when $p$ can be much larger than the available sample size $n$. It is well known that consistent estimation in such ultra-high dimensional situations requires regularization…
Two conjectures are presented. The first, Conjecture 1, is that the pushforward of a geometric distribution on the integers under $n$ Collatz iterates, modulo $2^p$, is usefully close to uniform distribution on the integers modulo $2^p$, if…
A non-trivial element of a group is a generalized torsion element if some products of its conjugates is the identity. The minimum number of such conjugates is called a generalized torsion order. We provide several restrictions for…
We present an algorithm for computing the so-called Beer-index of a polygon $P$ in $O(n^2)$ time, where $n$ is the number of corners. The polygon $P$ may have holes. The Beer-index is the probability that two points chosen independently and…