中文
相关论文

相关论文: An Investigation of the Chung-Feller Theorem

200 篇论文

We show that Fueter's theorem holds for a more general class of quaternionic functions than those constructed by the Fueter's method.

偏微分方程分析 · 数学 2007-05-23 Daniel Alayon-Solarz

We translate Uchimura's identity for the divisor function and whose generalizations into combinatorics of partitions, and give a combinatorial proof of them. As a by-product of their proofs, we obtain some combinatorial results.

组合数学 · 数学 2012-01-23 Masanori Ando

We explore the theory of illfounded and cyclic proofs for the propositional modal $\mu$-calculus. A fine analysis of provability for classical and intuitionistic modal logic provides a novel bridge between finitary, cyclic and illfounded…

In this paper, we give a new and short proof of a Theorem on k-hypertournament losing scores due to Zhou et al.[7].

组合数学 · 数学 2007-05-23 S. Pirzada , Zhou Guofei

We present a sequent-style proof system for provability logic GL that admits so-called circular proofs. For these proofs, the graph underlying a proof is not a finite tree but is allowed to contain cycles. As an application, we establish…

逻辑 · 数学 2015-01-05 Daniyar Shamkanov

Working in the axiomatic framework recently proposed by Gaberdiel and Goddard, we prove a generalized version of Zhu's Theorem; for any chiral bosonic conformal field theory on the sphere, our result characterizes the chiral blocks in terms…

高能物理 - 理论 · 物理学 2007-05-23 Andrew Neitzke

We give a new proof of the butterfly theorem, based on the use of several expressions involving the scale factor between the two wings.

历史与综述 · 数学 2016-10-25 Martin Celli

A convenient technique for proving kernel theorems for (LF)-spaces (countable inductive limits of Frechet spaces)is developed. The proposed approach is based on introducing a suitable modification of the functor of the completed inductive…

泛函分析 · 数学 2007-05-23 A. G. Smirnov

Brotherston and Simpson [citation] have formalized and investigated cyclic reasoning, reaching the important conclusion that it is at least as powerful as inductive reasoning (specifically, they showed that each inductive proof can be…

计算机科学中的逻辑 · 计算机科学 2011-03-25 Razvan Voicu , Mengran Li

The idea of generating integrals analogous to generating functions is first introduced in this paper. A new proof of the well-known Finite Harmonic Series Theorem in Analysis and Analytical Number Theory is then obtained by the method of…

经典分析与常微分方程 · 数学 2007-05-23 S. C. Woon

We give a short proof, based on symmetric function theory, of a formula due to Goupil and Schaeffer, counting the number of factorizations of a cycle of maximal length in the symmetric group, into the product of two permutations of given…

组合数学 · 数学 2007-05-23 Philippe Biane

We study induction on the program structure as a proof method for bisimulation-based compiler correctness. We consider a first-order language with mutually recursive function definitions, system calls, and an environment semantics. The…

编程语言 · 计算机科学 2016-11-30 Sigurd Schneider , Gert Smolka , Sebastian Hack

Let $Q$ be a finite acyclic valued quiver. We give the cluster multiplication formulas in the quantum cluster algebra of $Q$ with arbitrary coefficients, by applying certain quotients of derived Hall subalgebras of $Q$. These formulas can…

表示论 · 数学 2021-11-19 Xueqing Chen , Ming Ding , Haicheng Zhang

We prove the convergence case of Khintchine's theorem, with general approximation functions that are not necessarily monotonic, for analytic nonplanar manifolds over local fields of positive characteristic. Our approach is based on the…

数论 · 数学 2026-03-03 Noy Soffer Aranov , Sourav Das , Arijit Ganguly , Aratrika Pandey

Extending the idea in [Impagliazzo, R., Moore, C. and Russell, A., An entropic proof of Chang's inequality. SIAM Journal on Discrete Mathematics, 28(1), pp.173-176.] we give a short information theoretic proof for Chang's lemma that is…

离散数学 · 计算机科学 2020-05-25 Lianna Hambardzumyan , Yaqiao Li

In this paper we study the logical foundations of automated inductive theorem proving. To that aim we first develop a theoretical model that is centered around the difficulty of finding induction axioms which are sufficient for proving a…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Stefan Hetzl , Tin Lok Wong

We review our construction of the Teichm\"uller TQFT. We recall our volume conjecture for this TQFT and the examples for which this conjecture has been established. We end the paper with a brief review of our new formulation of the…

量子代数 · 数学 2018-11-19 Jørgen Ellegaard Andersen , Rinat Kashaev

We prove the equidistribution of subsets of $(\Rr/\Zz)^n$ defined by fractional parts of subsets of~$(\Zz/q\Zz)^n$ that are constructed using the Chinese Remainder Theorem.

数论 · 数学 2020-06-09 Emmanuel Kowalski , Kannan Soundararajan

Coinduction occurs in two guises in Horn clause logic: in proofs of circular properties and relations, and in proofs involving construction of infinite data. Both instances of coinductive reasoning appeared in the literature before, but a…

计算机科学中的逻辑 · 计算机科学 2019-03-19 Ekaterina Komendantskaya , Yue Li

We give a new proof of Chen-Lin result with Li-Zhang method.

偏微分方程分析 · 数学 2010-04-08 Samy Skander Bahoura