相关论文: Pity on lambda
We prove the famous Faber intersection number conjecture and other more general results by using a recursion formula of $n$-point functions for intersection numbers on moduli spaces of curves. We also present some vanishing properties of…
We discuss the ACC conjecture and the LSC conjecture for minimal log discrepancies of generalized pairs. We prove that some known results on these two conjectures for usual pairs are still valid for generalized pairs. We also discuss the…
Even though a lattice and its sublattices have the same group of coincidence isometries, the coincidence index of a coincidence isometry with respect to a lattice $\Lambda_1$ and to a sublattice $\Lambda_2$ may differ. Here, we examine the…
The present study provides another look on Lamperti's theorem on recurrence or transience of stochastic sequences. We establish connection between Lamperti's theorem and the recent result by the author [V. M. Abramov, Theor. Probab. Math.…
We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie…
The notion of topological entropy can be conceptualized in terms of the number of forward trajectories that are distinguishable at resolution $\varepsilon$ within $T$ time units. It can then be formally defined as a limit of a limit…
In the paper we complete a case by case proof of Reeder's Conjecture started in our previous work, proving the conjecture for simple Lie algebras of type $D$ and for the exceptional cases.
Exact and asymptotic formulae are displayed for the coefficients $\lambda_n$ used in Li's criterion for the Riemann Hypothesis. In particular, we argue that if (and only if) the Hypothesis is true, $\lambda_n \sim n(A \log n +B)$ for $n \to…
Given a unimodular lattice $\Lambda\subseteq \mathbb{R}^2$ consider the counting function $\mathcal{N}_\Lambda(T)$ counting the number of lattice points of norm less than $T$, and the remainder $\mathcal{R}_\Lambda(T)=\mathcal{N}(T)-\pi…
It is more important to estimate the rate of convergence to a stationary distribution rather than only to prove the existence one in many applied problems of reliability and queuing theory. This can be done via standard methods, but only…
The proof of Theorem 11 of the paper M. Scheepers, Remarks on countable tightness, Topology and its Applications 161 (2014), 407 - 432 relies on Lemma 10 of that paper. The offered proof of Lemma 10 had shortcomings, and I was recently…
We show that the number of types of sequences of tuples of a fixed length can be calculated from the number of 1-types and the length of the sequences. Specifically, if $\kappa \leq \lambda$, then $$\sup_{|A| = \lambda} |S^\kappa(A)| =…
For two derived equivalent $k$-algebras $\bar\Lambda$ and $\bar\Gamma$, we introduce a correspondence between $\OO$-orders reducing to $\bar\Lambda$ and $\OO$-orders reducing to $\bar\Gamma$. We outline how this may be used to transfer…
We establish a lower bound for the size of possible counterexamples of the Dixmier Conjecture. We prove that $B>15$, where $B$ is the minimum of the greatest common divisor of the total degrees of $P$ and $Q$, where $(P,Q)$ runs over the…
We present a lecture note on Thouvenot's proof of the Roth-Furstenberg theorem and joining proofs of Furstenberg's theorems on multiple progression average mixing for weakly mixing transformations.
The inhabitation problem for intersection types in the lambda-calculus is known to be undecidable. We study the problem in the case of non-idempotent intersection, considering several type assignment systems, which characterize the solvable…
Let $P$ be a $\delta$-separated $(\delta, s, C_P)$-set of points in $B(0, 1)\subset \mathbb{R}^d$ and $\Pi$ be a $\delta$-separated $(\delta, t, C_\Pi)$-set of hyperplanes intersecting $B(0, 1)$ in $\mathbb{R}^d$. Define \[I_{C\delta}(P,…
In this paper, we define a new realizability semantics for the simply typed lambda-mu-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. We also prove a completeness result of our realizability…
In analogy to the topological entropy for continuous endomorphisms of totally disconnected locally compact groups, we introduce a notion of topological entropy for continuous endomorphisms of locally linearly compact vector spaces. We study…
We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…