相关论文: A semiampleness criterion

We correct a misattribution in our book.

We consider the positive divisors of a natural number that do not exceed its square root, to which we refer as the {\it small divisors\/} of the natural number. We determine the asymptotic behavior of the arithmetic function that adds the…

We establish an explicit inequality for the number of divisors of an integer $n$. It uses the size of $n$ and its number of distinct prime divisors.

In this paper, we compute the asymptotic average of the decimals of some real numbers. With the help of this computation, we prove that if a real number cannot be represented as a finite decimal and the asymptotic average of its decimals is…

Let $k$ be an $F$-finite field containing an infinite perfect field of positive characteristic. Let $(X, \Delta)$ be a projective log canonical pair over $k$. In this note we show that, for a semi-ample divisor $D$ on $X$, there exists an…

Recently, a new and powerful separability criterion was introduced in [O. Rudolph, quant-ph/0202121] and [Chen {\it et al.}, quant-ph/0205017]. Composing the main idea behind the above criterion and the necessary and sufficient condition in…

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field and $A$ a standard graded $S$-algebra. In terms of the Gr\"obner basis of the defining ideal $J$ of $A$ we give a condition, called the x-condition, which implies that all graded…

We prove an extension of the classical Real Representation Theorem (going back to Krivine, Stone, Kadison, Dubois and Becker and often called Kadison-Dubois Theorem). It is a criterion for membership in subsemirings (sometimes called…

We consider the problem of whether a given decision model, working with structured data, has individual fairness. Following the work of Dwork, a model is individually biased (or unfair) if there is a pair of valid inputs which are close to…

Given two languages, a separator is a third language that contains the first one and is disjoint from the second one. We investigate the following decision problem: given two regular input languages of finite words, decide whether there…

A diagrammatic logical calculus for the syllogistic reasoning is introduced and discussed. We prove that a syllogism is valid if and only if it is provable in the calculus.

We construct a class of real-valued nonnegative binary functions on a set of jointly distributed random variables, which satisfy the triangle inequality and vanish at identical arguments (pseudo-quasi-metrics). These functions are useful in…

A finite group is called semi-rational if the distribution induced on it by any word map is a virtual character. Amit and Vishne give a sufficient condition for a group to be semi-rational, and ask whether it is also necessary. We answer…

A positive integer n is said to be perfect if sigma(n)=2n, where sigma denotes the sum of the divisors of n. In this article, we show that if n is an even perfect number, then any integer m<=n is expressed as a sum of some of divisors of n.

We present two tools, which could be useful in determining whether or not a non-Homogenous Linear Recurrence can reach a desired rational. First, we derive the determinant that is equal to the ith term in a non-Homogenous Linear Recurrence.…

Previous researches have shown that learning multiple representations for polysemous words can improve the performance of word embeddings on many tasks. However, this leads to another problem. Several vectors of a word may actually point to…

I survey recent progress on a classic and challenging problem in social choice: the fair division of indivisible items. I discuss how a computational perspective has provided interesting insights into and understanding of how to divide…

We establish an equidistribution result for push-forwards of certain locally finite algebraic measures in the adelic extension of the space of lattices in the plane. As an application of our analysis we obtain new results regarding the…

We give explicit and asymptotic lower bounds for the quantity $|e^{s/t}-M/N|$ by studying a generalized continued fraction expansion of $e^{s/t}$. In cases $|s|\geq 3$ we improve existing results by extracting a large common factor from the…

We give necessary and sufficient conditions for the Chebyshev inequality to be an equality.