中文
相关论文

相关论文: On a general theorem for additive Levy processes

200 篇论文

We prove new fundamental lemma and arithmetic fundamental lemma identities for general linear groups over quaternion division algebras. In particular, we verify the transfer conjeture and the arithmetic transfer conjecture from…

数论 · 数学 2024-08-30 Nuno Hultberg , Andreas Mihatsch

We prove a generalization of Lopes's theorem, that is, of the converse of Brolin's theorem.

动力系统 · 数学 2018-08-21 Yusuke Okuyama , Malgorzata Stawiska

We prove the abundance theorem for numerically trivial log canonical divisors of log canonical pairs and semi-log canonical pairs.

代数几何 · 数学 2010-09-14 Yoshinori Gongyo

A very simple but useful almost sure convergence theorem of probability is given.

综合数学 · 数学 2011-12-19 Masumi Nakajima

In this paper we expound some basic ideas of proof theory for theories of ordinals such that there are many stable ordinals below the ordinals.

逻辑 · 数学 2011-04-12 Toshiyasu Arai

Our goal in the present paper is to give a new ergodic proof of a well-known Veech's result, build upon our previous works.

动力系统 · 数学 2017-03-07 Panagiotis Georgopoulos

We develop a (co)algebraic framework to study a family of process calculi with monadic branching structures and recursion operators. Our framework features a uniform semantics of process terms and a complete axiomatisation of semantic…

计算机科学中的逻辑 · 计算机科学 2022-07-26 Todd Schmid , Wojciech Rozowski , Alexandra Silva , Jurriaan Rot

We give a simple proof of a crucial lemma that is established in [1, Lemma 2.1] by induction, and plays important roles in that paper and [2].

泛函分析 · 数学 2018-07-12 Shibo Liu

We provide new sufficient conditions under which Ryser's conjecture holds.

数论 · 数学 2025-09-03 Antun Domic , Luis H. Gallardo

The generalized divided differences are introduced. They are applied to investigate some properties characterizing generalized higher-order convexity. Among others some support-type property is proved.

泛函分析 · 数学 2008-07-28 Szymon Wasowicz

Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.

数论 · 数学 2019-02-20 Dimitris Koukoulopoulos

In this note, we extend the theories of the canonical bundle formula and adjunction to the case of generalized pairs. As an application, we study a particular case of a conjecture by Prokhorov and Shokurov.

代数几何 · 数学 2021-08-12 Stefano Filipazzi

In this paper, we prove a new generalized Mikhlin multiplier theorem whose conditions are given with respect to fractional derivatives in integral forms with two different integration intervals. We also discuss the connection between…

概率论 · 数学 2018-06-27 Deniz Karli

We show a new large sieve version of the Brun-Titchmarsh theorem.

数论 · 数学 2012-01-17 Yoichi Motohashi

In this paper, we present a new set-valued Lagrange multiplier theorem for constrained convex set-valued optimization problems. We introduce the novel concept of Lagrange process. This concept is a natural extension of the classical concept…

最优化与控制 · 数学 2024-01-19 Fernando García-Castaño , M. A. Melguizo Padial

We develop a theory of general sheaves over weighted projective lines. We define and study a canonical decomposition, analogous to Kac's canonical decomposition for representations of quivers, study subsheaves of a general sheaf, general…

代数几何 · 数学 2007-09-24 William Crawley-Boevey

We deal with an iteration theorem of forcing notion with a kind of countable support of nice enough forcing notion which is proper aleph_2-c.c. forcing notions. We then look at some special cases (Q_D 's preceded by random forcing).

逻辑 · 数学 2007-05-23 Saharon Shelah

This paper is concerned with the concept of linear repetitivity in the theory of tilings. We prove a general uniform subadditive ergodic theorem for linearly repetitive tilings. This theorem unifies and extends various known (sub)additive…

动力系统 · 数学 2015-02-24 David Damanik , Daniel Lenz

We prove a connectedness result for products of weighted projective spaces.

代数几何 · 数学 2007-05-23 Lucian Badescu , Flavia Repetto

We give new proofs for the hardness amplification of efficiently samplable predicates and of weakly verifiable puzzles which generalize to new settings. More concretely, in the first part of the paper, we give a new proof of Yao's XOR-Lemma…

密码学与安全 · 计算机科学 2010-12-30 Thomas Holenstein , Grant Schoenebeck