Toeplitz Determinants with Singular Generating Functions

1973 ◽  
Vol 95 (2) ◽  
pp. 333 ◽  
Author(s):  
Harold Widom
Keyword(s):  
Generating Functions ◽  
Toeplitz Determinants

ASYMPTOTICS OF A TAU-FUNCTION AND TOEPLITZ DETERMINANTS WITH SINGULAR GENERATING FUNCTIONS

1992 ◽  
Vol 07 (supp01a) ◽  
pp. 83-107 ◽  
Author(s):  
ESTELLE L. BASOR ◽  
CRAIG A. TRACY
Keyword(s):  
Generating Functions ◽  
Short Distance ◽  
Quantum Fields ◽  
Toeplitz Determinants ◽  
Tau Function

We compute the short distance asymptotics of a tau-fucntion appearing in the work of Sato, Miwa, and Jimbo on holonomic quantum fields, We show that these asymptotics are determined by the Widom operator. This same operator is fundamental in the asymptotics of Toeplitz determinants with singular generating fucntions.

Short Generating Functions for some Semigroup Algebras

10.37236/1729 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Graham Denham
Keyword(s):  
Rational Function ◽  
Generating Functions ◽  
Hilbert Series ◽  
Simple Expression ◽  
Arbitrary Field ◽  
Graded Algebra ◽  
Semigroup Algebras ◽  
Positive Integers

Let $a_1,\ldots,a_n$ be distinct, positive integers with $(a_1,\ldots,a_n)=1$, and let k be an arbitrary field. Let $H(a_1,\ldots,a_n;z)$ denote the Hilbert series of the graded algebra k$[t^{a_1},t^{a_2},\ldots,t^{a_n}]$. We show that, when $n=3$, this rational function has a simple expression in terms of $a_1,a_2,a_3$; in particular, the numerator has at most six terms. By way of contrast, it is known that no such expression exists for any $n\geq4$.

New family of Whitney numbers

Filomat ◽  
2017 ◽  
Vol 31 (2) ◽  
pp. 309-320 ◽  
Author(s):  
B.S. El-Desouky ◽  
Nenad Cakic ◽  
F.A. Shiha
Keyword(s):  
Generating Functions ◽  
Recurrence Relations ◽  
Stirling Numbers ◽  
Explicit Formulas ◽  
Basic Properties ◽  
New Family ◽  
Whitney Numbers ◽  
Special Cases

In this paper we give a new family of numbers, called ??-Whitney numbers, which gives generalization of many types of Whitney numbers and Stirling numbers. Some basic properties of these numbers such as recurrence relations, explicit formulas and generating functions are given. Finally many interesting special cases are derived.

Identities related to special polynomials and combinatorial numbers

Filomat ◽  
2017 ◽  
Vol 31 (15) ◽  
pp. 4833-4844 ◽  
Author(s):  
Eda Yuluklu ◽  
Yilmaz Simsek ◽  
Takao Komatsu
Keyword(s):  
Generating Functions ◽  
Functional Equations ◽  
Stirling Numbers ◽  
Bernoulli Numbers ◽  
Euler Numbers ◽  
Special Polynomials ◽  
Central Factorial Numbers

The aim of this paper is to give some new identities and relations related to the some families of special numbers such as the Bernoulli numbers, the Euler numbers, the Stirling numbers of the first and second kinds, the central factorial numbers and also the numbers y1(n,k,?) and y2(n,k,?) which are given Simsek [31]. Our method is related to the functional equations of the generating functions and the fermionic and bosonic p-adic Volkenborn integral on Zp. Finally, we give remarks and comments on our results.

Symplectic capacities

2017 ◽  
Author(s):  
Dusa McDuff ◽  
Dietmar Salamon
Keyword(s):  
Euclidean Space ◽  
Generating Functions ◽  
Weinstein Conjecture ◽  
Finite Dimensional ◽  
Hofer Metric

This chapter returns to the problems which were formulated in Chapter 1, namely the Weinstein conjecture, the nonsqueezing theorem, and symplectic rigidity. These questions are all related to the existence and properties of symplectic capacities. The chapter begins by discussing some of the consequences which follow from the existence of capacities. In particular, it establishes symplectic rigidity and discusses the relation between capacities and the Hofer metric on the group of Hamiltonian symplectomorphisms. The chapter then introduces the Hofer–Zehnder capacity, and shows that its existence gives rise to a proof of the Weinstein conjecture for hypersurfaces of Euclidean space. The last section contains a proof that the Hofer–Zehnder capacity satisfies the required axioms. This proof translates the Hofer–Zehnder variational argument into the setting of (finite-dimensional) generating functions.

Poisson Brackets & Angular Momentum

2018 ◽  
Author(s):  
Peter Mann
Keyword(s):  
Generating Functions ◽  
First Integrals ◽  
Lagrangian Mechanics ◽  
Poisson Brackets ◽  
Coordinate Transformations ◽  
Canonical Transformations ◽  
Gauge Transformations ◽  
The Third ◽  
Point Transformations ◽  
Canonical Coordinate

This chapter discusses canonical transformations and gauge transformations and is divided into three sections. In the first section, canonical coordinate transformations are introduced to the reader through generating functions as the extension of point transformations used in Lagrangian mechanics, with the harmonic oscillator being used as an example of a canonical transformation. In the second section, gauge theory is discussed in the canonical framework and compared to the Lagrangian case. Action-angle variables, direct conditions, symplectomorphisms, holomorphic variables, integrable systems and first integrals are examined. The third section looks at infinitesimal canonical transformations resulting from functions on phase space. Ostrogradsky equations in the canonical setting are also detailed.

On calculating extinction probabilities for branching processes in random environments

1969 ◽  
Vol 6 (03) ◽  
pp. 478-492 ◽  
Author(s):  
William E. Wilkinson
Keyword(s):  
Generating Functions ◽  
Infinite Sequence ◽  
Branching Processes ◽  
Transition Probability ◽  
Transition Probability Matrix ◽  
Random Environments ◽  
Real Numbers ◽  
Discrete Time Markov Chain ◽  
Extinction Probabilities ◽  
Image Position

Consider a discrete time Markov chain {Zn } whose state space is the non-negative integers and whose transition probability matrix ║Pij ║ possesses the representation where {Pr }, r = 1,2,…, is a finite or denumerably infinite sequence of non-negative real numbers satisfying , and , is a corresponding sequence of probability generating functions. It is assumed that Z 0 = k, a finite positive integer.

Sign in / Sign up

Export Citation Format

Share Document