中文
相关论文

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

200 篇论文

In this paper, we shall prove the Chung-Feller Theorem in several ways. We provide an inductive proof, bijective proof, and proofs using generating functions, and the Cycle Lemma of Dvoretzky and Motzkin.

组合数学 · 数学 2007-05-23 Eli A. Wolfhagen

In this paper we analyze a L\'evy process reflected at a general (possibly random) barrier. For this process we prove Central Limit Theorem for the first passage time. We also give the finite-time first passage probability asymptotics.

概率论 · 数学 2017-05-08 Zbigniew Palmowski , Przemysław Świątek

Additive relations are defined over additive monoids and additive operation is introduced over these new relations then we build algebraic system of equations. We can generate profuse equations by additive relations of two variables. To…

综合数学 · 数学 2012-03-06 Ziqian Wu

Theorem proving is a fundamental aspect of mathematics, spanning from informal reasoning in natural language to rigorous derivations in formal systems. In recent years, the advancement of deep learning, especially the emergence of large…

人工智能 · 计算机科学 2024-08-23 Zhaoyu Li , Jialiang Sun , Logan Murphy , Qidong Su , Zenan Li , Xian Zhang , Kaiyu Yang , Xujie Si

We give two different definitions of what it means for a matrix-valued function to be log concave, guided by similar notions in complex differential geometry. After discussing a few simple examples, we proceed to develop some of the basic…

复变函数 · 数学 2013-12-02 Hossein Raufi

We give here a new proof of a Tauberian Theorem of complex Laplace transform using the Theory of measure and theory of function with bounded variations. However we deduce the simple proof of Prime Number Theorem.

数论 · 数学 2014-03-03 Lahoucine Elaissaoui

We suggest an alternative proof of a theorem due to Lambek and Moser using a perceptible model.

数论 · 数学 2012-07-25 Yuval Ginosar

In this paper, we prove convergence in distribution of Langevin processes in the overdamped asymptotics. The proof relies on the classical perturbed test function (or corrector) method, which is used both to show tightness in path space,…

概率论 · 数学 2019-03-11 Mathias Rousset , Yushun Xu , Pierre-André Zitt

We give a new criterion for solvability of group equations, providing proofs of various generalizations of the Kervaire-Laudenbach conjecture for Connes-embeddable groups.

群论 · 数学 2021-09-27 Martin Nitsche , Andreas Thom

We show on- and off-diagonal upper estimates for the transition densities of symmetric Levy and Levy-type processes. To get the an-diagonal estimates we prove a Nash type inequality for the related Dirichlet form. For the off-diagonal…

概率论 · 数学 2010-06-23 V. Knopova , R. Schilling

With the uniform positions we prove theorems of Landau and Hardy-Littlwood type for Goldbach, Chen, Lemoine-Levy and other binary partitions of positive integers. We also pose some new conjectures.

数论 · 数学 2012-03-27 Vladimir Shevelev

We present some further results on Liouville type theorems for some conformally invariant fully nonlinear equations.

偏微分方程分析 · 数学 2007-05-23 Aobing Li , YanYan Li

Using the notion of existentially closed structures, we obtain embedding theorems for groups and Lie algebras. We also prove the existence of some groups and Lie algebras with prescribed properties.

群论 · 数学 2014-05-07 M. Shahryari

We prove a stronger version of a termination theorem appeared in the paper "On existence of log minimal models II". We essentially just get rid of the redundant assumptions so the proof is almost the same as in there. However, we give a…

代数几何 · 数学 2011-04-27 Caucher Birkar

In this paper a new conjecture equivalent to Collatz conjecture is presented. In particural, showing that (all) the solution(s) of newly introduced iterative functional equation(s) have a given property is equivalent to prove Collatz…

综合数学 · 数学 2023-05-18 Giulio Masetti

We prove a uniqueness theorem for an entire function, which shares certain values with its higher order derivatives.

复变函数 · 数学 2014-05-02 Indrajit Lahiri , Rajib Mukherjee

We introduce a theorem proving algorithm that uses practically no domain heuristics for guiding its connection-style proof search. Instead, it runs many Monte-Carlo simulations guided by reinforcement learning from previous proof attempts.…

人工智能 · 计算机科学 2018-05-22 Cezary Kaliszyk , Josef Urban , Henryk Michalewski , Mirek Olšák

Generalizing Kyprianou--Loeffen's refracted L\'evy processes, we define a new refracted L\'evy process which is a Markov process whose positive and negative motions are L\'evy processes different from each other. To construct it we utilize…

概率论 · 数学 2019-04-08 Kei Noba , Kouji Yano

Motivated by two Legendre-type formulas for overpartitions, we derive a variety of their companions as Legendre theorems for overpartition pairs. This leads to equalities of subclasses of overpartitions and overpartition pairs.

数论 · 数学 2024-12-17 George E. Andrews , Mohamed El Bachraoui

The purpose of this survey is to present analytic versions of the injectivity theorem and their applications. The proof of our injectivity theorems is based on a combination of the L^2-method for the dbar-equation and the theory of harmonic…

复变函数 · 数学 2015-11-16 Shin-ichi Matsumura