Related papers: Intersection statistics for antichains in minuscul…
In this article we introduce a simple tool to derive polynomial upper bounds for the probability of observing unusually large maximal components in some models of random graphs when considered at criticality. Specifically, we apply our…
Let $\mathcal{A}\subseteq{[n]\choose a}$ and $\mathcal{B}\subseteq{[n]\choose b}$ be two families of subsets of $[n]$, we say $\mathcal{A}$ and $\mathcal{B}$ are cross-intersecting if $A\cap B\neq \emptyset$ for all $A\in\mathcal{A}$,…
This paper studies when a sequence of probability measures on a metric space admit subsequential weak limits. A sufficient condition called sequential tightness is formulated, which relaxes some assumptions for asymptotic tightness used in…
For a reductive Lie algebra $\mathfrak h$ and a simple finite-dimensional $\mathfrak h$-module $V$, the set of weights of $V$, $P(V)$, has a natural poset structure. We consider antichains in the weight poset $P(V)$ and a certain operator…
Interactions between several features sometimes play an important role in prediction tasks. But taking all the interactions into consideration will lead to an extremely heavy computational burden. For categorical features, the situation is…
We investigate arcs on a pair of pants and present an algorithm to compute the self-intersection number of an arc. Additionally, we establish bounds for the self-intersection number in terms of the word length. We also prove that the…
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their intersection can be computed in a worst-case efficient way. In…
We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…
In this paper, we consider the average size of independent edge sets, also called matchings, in a graph. We characterize the extremal graphs for the average size of matchings in general graphs and trees. In addition, we obtain inequalities…
The purpose of this note is to study the asymptotic volume of intersections of unit balls associated with two norms in $\mathbb{R}^n$ as their dimension $n$ tends to infinity. A general framework is provided and then specialized to the…
We prove two conjectures on weighted complete intersections and give the complete classification of threefold weighted complete intersections in weighted projective space that are canonically or anticanonically embedded.
Let $n\geqslant 4$ be a natural number, and let $K$ be a set $K\subseteq [n]:={1,2,...,n}$. We study the problem to find the smallest possible size of a maximal family $\mathcal{A}$ of subsets of $[n]$ such that $\mathcal{A}$ contains only…
We study a heavy piston that separates finitely many ideal gas particles moving inside a one-dimensional gas chamber. Using averaging techniques, we prove precise rates of convergence of the actual motions of the piston to its averaged…
A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…
In this article pattern statistics of typical cubical cut and project sets are studied. We give estimates for the rate of convergence of appearances of patches to their asymptotic frequencies. We also give bounds for repetitivity and…
In this thesis we study in detail the self-intersection properties of Random Walks. Although notoriously hard to tackle, these properties are crucially related to the excluded-volume effect and other central features of real polymers. Our…
In this work we study the intersection properties of a finite disk system in the euclidean space. We accomplish this by utilizing subsets of spheres with varying dimensions and analyze specific points within them, referred to as poles.…
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…
The algebraic variety defined by the idempotents of an incidence monoid is investigated. Its irreducible components are determined. The intersection with an antichain submonoid is shown to be the union of these irreducible components. The…
The standard notion of poset probability of a finite poset P involves calculating, for incomparable $\alpha$, $\beta$ in P, the number of linear extensions of P for which $\alpha$ precedes $\beta$. The fraction of those linear extensions…