中文
相关论文

相关论文: Exponentiation and Euler measure

200 篇论文

We extend the well-known Shannon decomposition of Boolean functions to more general classes of functions. Such decompositions, which we call pivotal decompositions, express the fact that every unary section of a function only depends upon…

环与代数 · 数学 2014-06-10 Jean-Luc Marichal , Bruno Teheux

We show that integration with respect to the Euler-Poincar\'e characteristic can be extended from the setting of definable sets to the setting of topological spaces homeomorphic to definable sets. We use that extension to generalize a…

代数拓扑 · 数学 2018-07-05 E. Macías-Virgós , D. Mosquera-Lois

Combinatorial enumeration leads to counting generating functions presenting a wide variety of analytic types. Properties of generating functions at singularities encode valuable information regarding asymptotic counting and limit…

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

Tangent numbers $T_{2n-1}$, which enumerate alternating permutations of odd length, play a prominent role in the Taylor series expansion of the tangent function $\tan(x)$. In this work, we adopt a combinatorial approach based on the…

组合数学 · 数学 2026-03-25 Jean-Christophe Pain

We introduce and study block-separated overpartitions, a constrained family of overpartitions in which no two consecutive distinct part-blocks are both overlined. This local restriction produces a new sequence that naturally interpolates…

组合数学 · 数学 2026-03-09 El-Mehdi Mehiri

We prove combinatorially some identities related to Euler's partition identity (the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts). They were conjectured by Beck and proved by Andrews…

组合数学 · 数学 2018-07-02 Cristina Ballantine , Richard Bielak

Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…

计算机科学中的逻辑 · 计算机科学 2025-10-22 Tom de Jong , Nicolai Kraus , Fredrik Nordvall Forsberg , Chuangjie Xu

Using the theory of exponential Riordan arrays and orthogonal polynomials, we demonstrate that the "descending power" Eulerian polynomials, and their once shifted sequence, are moment sequences for simple families of orthogonal polynomials,…

组合数学 · 数学 2011-05-17 Paul Barry

In the present paper, we introduce Eulerian polynomials with a and b parameters and give the definition of them. By using the definition of generating function for our polynomials, we derive some new identities in Theory of Analytic…

数论 · 数学 2019-07-04 Serkan Araci , Mehmet Acikgoz , Erdoğan Şen

We extend the recently introduced setting of coherent differentiation for taking into account not only differentiation, but also Taylor expansion in categories which are not necessarily (left)additive. The main idea consists in extending…

计算机科学中的逻辑 · 计算机科学 2025-04-16 Thomas Ehrhard , Aymeric Walch

We develop first steps in the study of factorizations of elements in ultraproducts of commutative cancellative monoids into irreducible elements. A complete characterization of the (multi-)sets of lengths in such objects is given. As…

交换代数 · 数学 2023-11-29 Daniel Windisch

We obtain in closed form averages of polynomials, taken over hermitian matrices with the Gaussian measure involved in the Kontsevich integral, and prove a conjecture of Witten enabling one to express analogous averages with the full (cubic…

高能物理 - 理论 · 物理学 2015-06-26 P. Di Francesco , C. Itzykson , J. -B. Zuber

The concern of this paper is a famous combinatorial formula known under the name "exponential formula". It occurs quite naturally in many contexts (physics, mathematics, computer science). Roughly speaking, it expresses that the exponential…

离散数学 · 计算机科学 2010-11-04 L. Poinsot , G. H. E. Duchamp , S. Goodenough , K. A. Penson

Many clustering schemes are defined by optimizing an objective function defined on the partitions of the underlying set of a finite metric space. In this paper, we construct a framework for studying what happens when we instead impose…

机器学习 · 统计学 2010-12-01 Gunnar Carlsson , Facundo Memoli

In recent years, much work in descriptive set theory has been focused on the Borel complexity of naturally occurring classification problems, in particular, the study of countable Borel equivalence relations and their structure under the…

逻辑 · 数学 2013-06-07 Jay Williams

We introduce and study equivariant Hilbert series of ideals in polynomial rings in countably many variables that are invariant under a suitable action of a symmetric group or the monoid $Inc(\mathbb{N})$ of strictly increasing functions.…

交换代数 · 数学 2021-05-18 Uwe Nagel , Tim Roemer

Andr\'e proved that the number of alternating permutations on $\{1, 2, \dots, n\}$ is equal to the Euler number $E_n$. A refinement of Andr\'e's result was given by Entringer, who proved that counting alternating permutations according to…

组合数学 · 数学 2022-03-22 Yoann Gelineau , Heesung Shin , Jiang Zeng

Many mathematicians have been studying various degenerate versions of special polynomials and numbers in some arithmetic and combinatorial aspects. Our main focus here is a new type of degenerate poly-Euler polynomials and numbers. This…

组合数学 · 数学 2022-10-19 Yuankui Ma , Taekyun Kim , Hongze Li

The Poincare series of a multi-index filtration on the ring of germs of functions can be written as a certain integral with respect to the Euler characteristic over the projectivization of the ring. Here this integral is considered with…

代数几何 · 数学 2007-05-23 Antonio Campillo , Felix Delgado , Sabir M. Gusein-Zade

One can think of power series or polynomials in one variable, such as $P(x)=2x^3+x+5$, as functors from the category $\mathsf{Set}$ of sets to itself; these are known as polynomial functors. Denote by $\mathsf{Poly}_{\mathsf{Set}}$ the…

范畴论 · 数学 2020-11-05 David I. Spivak , David Jaz Myers