Related papers: On the J\'onsson distributivity spectrum

Let $p\ge 7$ be a prime, and $m\ge 5$ an integer. A natural generalization of Bring's curve valid over any field $\mathbb{K}$ of zero characteristic or positive characteristic $p$, is the algebraic variety $V$ of…

We study symmetric correspondences with completely decomposable minimal equation on smooth projective curves $C$. The Jacobian of $C$ then decomposes correspondingly. For all positive integers $g$ and $\ell$, we give series of examples of…

The main result of this paper is the proof of the simultaneous consistency, modulo a weakly compact cardinal, of the equality $2^{< \mathfrak{c}} = \mathfrak{c}$ with the following property (*) of partitions of pairs of $\mathfrak{c}$:…

Let $B(n,p)$ denote a binomial random variable with parameters $n$ and $p$. Chv\'{a}tal's theorem says that for any fixed $n\geq 2$, as $m$ ranges over $\{0,\ldots,n\}$, the probability $q_m:=P(B(n,m/n)\leq m)$ is the smallest when $m$ is…

This paper is a summary of discussions at the recent ITEP-JINR-YerPhI workshop on Vogel theory in Dubna. We consider relation between Vogel divisor(s) and the old Dynkin classification of simple Lie algebras. We consider application to knot…

The clique graph $kG$ of a graph $G$ has as its vertices the cliques (maximal complete subgraphs) of $G$, two of which are adjacent in $kG$ if they have non-empty intersection in $G$. We say that $G$ is clique convergent if $k^nG\cong k^m…

A list assignment $L$ for a graph $G$ is an $(\ell,k)$-list assignment if $|L(v)|\geq \ell$ for each $v \in V(G)$ and $|L(u) \cap L(v)| \leq k$ for each $uv \in E(G)$. We say $G$ is $(\ell,k)$-choosable if it admits an $L$-colouring for…

Suppose that $\mathcal M$ is a countably decomposable type II$_1$ von Neumann algebra and $\mathcal A$ is a separable, non-nuclear, unital C$^*$-algebra. We show that, if $\mathcal M$ has Property $\Gamma$, then the similarity degree of…

Let the finite distributive lattice $D$ be isomorphic to the congruence lattice of a finite lattice $L$. Let $Q$ denote those elements of $D$ that correspond to principal congruences under this isomorphism. Then $Q$ contains $0,1 \in D$ and…

Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each member of $\mathcal{A}$ intersects each member of $\mathcal{B}$. For any two integers $n$ and $k$ with $0 \leq k \leq n$, let ${[n] \choose \leq…

In this paper, we present three remarkable properties of the normal distribution: first that if two independent variables's sum is normally distributed, then each random variable follows a normal distribution (which is referred to as the…

It is shown that an arbitrary function from $D\subset \R^n$ to $\R^m$ will become $C^{0,\alpha}$-continuous in almost every $x\in D$ after restriction to a certain subset with limit point $x$. For $n\geq m$ differentiability can be…

In this paper, we give some conditions, under which, if an infinitely divisible distribution supported on $[0,\infty)$ belongs to the intersection of exponential distribution class $\mathcal{L}(\gamma)$ for some $\gamma\ge0$ and generalised…

Let $S$ be a reduced $E$-Fountain semigroup. If $S$ satisfies the congruence condition, there is a natural construction of a category $\mathcal{C}$ associated with $S$. We define a $\Bbbk$-module homomorphism $\varphi:\Bbbk…

Let $\mathbb{F}$ be a non-archimedean local field of positive characteristic different from 2. We consider distributions on $\mathrm{GL}(n+1,\mathbb{F})$ which are invariant under the adjoint action of $\mathrm{GL}(n,\mathbb{F})$. We prove…

We compute the exact and limiting smallest eigenvalue distributions for two classes of $\beta$-Jacobi ensembles not covered by previous studies. In the general $\beta$ case, these distributions are given by multivariate hypergeometric…

A dominating set in a graph $G$ is a subset of vertices $D$ such that every vertex in $V\setminus D$ is a neighbor of some vertex of $D$. The domination number of $G$ is the minimum size of a dominating set of $G$ and it is denoted by…

Given an integer $k$, deciding whether a graph has a clique of size $k$ is an NP-complete problem. Wilf's inequality provides a spectral bound for the clique number of simple graphs. Wilf's inequality is stated as follows: $\frac{n}{n -…

Let $\F$ be an algebraically closed field. Let $\V$ be a vector space equipped with a non-degenerate symmetric or symplectic bilinear form $B$ over $\F$. Suppose the characteristic of $\F$ is \emph{large}, i.e. either zero or greater than…

Fix $\alpha>0$, then by Fej\'er's theorem $ (\alpha(\log n)^{A}\,\mathrm{mod}\,1)_{n\geq1}$ is uniformly distributed if and only if $A>1$. We sharpen this by showing that all correlation functions, and hence the gap distribution, are…