Analytic Combinatorics is a self-contained treatment of the mathematics underlying the analysis of discrete structures, which has emerged over the past several decades as an essential tool in the understanding of properties of computer programs and scientific models with applications in physics, biology and chemistry. Thorough treatment of a large number of classical applications is an essential aspect of the presentation. Written by the leaders in the field of analytic combinatorics, this text is certain to become the definitive reference on the topic. The text is complemented with exercises, examples, appendices and notes to aid understanding therefore, it can be used as the basis for an advanced undergraduate or a graduate course on the subject, or for self-study.

Analytic Combinatorics

The On-Line Encyclopedia of Integer Sequences (or OEIS) is a database of some 130000 number sequences. It is freely available on the Web (http://www.research.att.com/~njas/sequences/) and is widely used.

There are several ways in which it benefits research: 1 It serves as a dictionary, to tell the user what is known about a particular sequence. There are hundreds of papers which thank the OEIS for assistance in this way.
 1 The associated Sequence Fans mailing list is a worldwide network which has evolved into a powerful machine for tackling new problems.
 1 As a direct source of new theorems, when a sequence arises in two different contexts.
 1 As a source of new research, when one sees a sequence in the OEIS that cries out to be analyzed.
 

The 40-year history of the OEIS recapitulates the story of modern computing, from punched cards to the internet.

The talk will be illustrated with numerous examples, emphasizing new sequences that have arrived in the past few months. Many open problems will be mentioned.

Because of the profusion of books and journals, volunteers play an important role in maintaining the database. If you come across an interesting number sequence in a book, journal or web site, please send it and the reference to the OEIS. (You do not need to be the author of the sequence to do this.) There is a web site for sending in "Comments" or "New sequences".

Several new features have been added to the OEIS in the past year. Thanks to the work of Russ Cox, searches are now performed at high speed, and thanks to the work of Debby Swayne, there is a button which displays plots of each sequence. Finally, a "listen" button enables one to hear the sequence played on a musical instrument (try Recamaan's sequence A005132!).

/pdf/the-on-line-encyclopedia-of-integer-sequences-okduuz5t6g.pdf

The On-Line Encyclopedia of Integer Sequences

In the first part of this thesis, we introduce a specific class of Linear Matrix Inequalities (LMI) whose optimal solution can be characterized exactly. This family corresponds to the case where the associated linear operator maps the cone of positive semidefinite matrices onto itself. In this case, the optimal value equals the spectral radius of the operator. It is shown that some rank minimization problems, as well as generalizations of the structured singular value ($mu$) LMIs, have exactly this property.

In the same spirit of exploiting structure to achieve computational efficiency, an algorithm for the numerical solution of a special class of frequency-dependent LMIs is presented. These optimization problems arise from robustness analysis questions, via the Kalman-Yakubovich-Popov lemma. The procedure is an outer approximation method based on the algorithms used in the computation of hinf norms for linear, time invariant systems. The result is especially useful for systems with large state dimension.

The other main contribution in this thesis is the formulation of a convex optimization framework for semialgebraic problems, i.e., those that can be expressed by polynomial equalities and inequalities. The key element is the interaction of concepts in real algebraic geometry (Positivstellensatz) and semidefinite programming.

To this end, an LMI formulation for the sums of squares decomposition for multivariable polynomials is presented. Based on this, it is shown how to construct sufficient Positivstellensatz-based convex tests to prove that certain sets are empty. Among other applications, this leads to a nonlinear extension of many LMI based results in uncertain linear system analysis.

Within the same framework, we develop stronger criteria for matrix copositivity, and generalizations of the well-known standard semidefinite relaxations for quadratic programming.

Some applications to new and previously studied problems are presented. A few examples are Lyapunov function computation, robust bifurcation analysis, structured singular values, etc. It is shown that the proposed methods allow for improved solutions for very diverse questions in continuous and combinatorial optimization.

Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization

Wave propagation and group velocity

Linear differential equations form the central topic of this volume, Galois theory being the unifying theme.
A large number of aspects are presented: algebraic theory especially differential Galois theory, formal theory, classification, algorithms to decide solvability in finite terms, monodromy and Hilbert's 21st problem, asymptotics and summability, the inverse problem and linear differential equations in positive characteristic. The appendices aim to help the reader with concepts used, from algebraic geometry, linear algebraic groups, sheaves, and tannakian categories that are used.
This volume will become a standard reference for all mathematicians in this area of mathematics, including graduate students.

Galois theory of linear differential equations

Hypergeometric solutions of linear recurrences with polynomial coefficients

An introduction to pseudo-linear algebra

第１部 背景（証明機械；目的を絞って；超幾何データベース） 第２部 ５種類の基本アルゴリズム（Ｓｉｓｔｅｒ Ｃｅｌｉｎｅ法；Ｇｏｓｐｅｒのアルゴリズム；Ｚｅｉｌｂｅｒｇｅｒのアルゴリズム；ＷＺ現象；アルゴリズムＨｙｐｅｒ） 第３部 エピローグ（作用素代数の観点）

A=b : 等式証明とコンピュータ

Linear recurrences with constant coefficients: the multivariate case

http://lbk.fe.uni-lj.si/pdfs/bb2005dm.pdf

The effect of high frequency electric pulses on muscle contractions and antitumor efficiency in vivo for a potential use in clinical electrochemotherapy

Marko Petkovšek

Papers

Hypergeometric solutions of linear recurrences with polynomial coefficients

An introduction to pseudo-linear algebra

A=b : 等式証明とコンピュータ

Linear recurrences with constant coefficients: the multivariate case

The effect of high frequency electric pulses on muscle contractions and antitumor efficiency in vivo for a potential use in clinical electrochemotherapy