All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1 Next

Displaying 1 – 20 of 158

Showing per page

Sagbi bases of Cox–Nagata rings

Bernd Sturmfels, Zhiqiang Xu (2010)

Journal of the European Mathematical Society

We degenerate Cox–Nagata rings to toric algebras by means of sagbi bases induced by configurations over the rational function field. For del Pezzo surfaces, this degeneration implies the Batyrev–Popov conjecture that these rings are presented by ideals of quadrics. For the blow-up of projective n -space at n + 3 points, sagbi bases of Cox–Nagata rings establish a link between the Verlinde formula and phylogenetic algebraic geometry, and we use this to answer questions due to D’Cruz–Iarrobino and Buczyńska–Wiśniewski....

Secant tree calculus

Dominique Foata, Guo-Niu Han (2014)

Open Mathematics

A true Tree Calculus is being developed to make a joint study of the two statistics “eoc” (end of minimal chain) and “pom” (parent of maximum leaf) on the set of secant trees. Their joint distribution restricted to the set {eoc-pom ≤ 1} is shown to satisfy two partial difference equation systems, to be symmetric and to be expressed in the form of an explicit three-variable generating function.

Self-avoiding walks on the lattice ℤ² with the 8-neighbourhood system

Andrzej Chydziński, Bogdan Smołka (2001)

Applicationes Mathematicae

This paper deals with the properties of self-avoiding walks defined on the lattice with the 8-neighbourhood system. We compute the number of walks, bridges and mean-square displacement for N=1 through 13 (N is the number of steps of the self-avoiding walk). We also estimate the connective constant and critical exponents, and study finite memory and generating functions. We show applications of this kind of walk. In addition, we compute upper bounds for the number of walks and the connective constant....

Self-complementary hypergraphs

A. Paweł Wojda (2006)

Discussiones Mathematicae Graph Theory

A k-uniform hypergraph H = (V;E) is called self-complementary if there is a permutation σ:V → V, called self-complementing, such that for every k-subset e of V, e ∈ E if and only if σ(e) ∉ E. In other words, H is isomorphic with H ' = ( V ; V k - E ) . In the present paper, for every k, (1 ≤ k ≤ n), we give a characterization of self-complementig permutations of k-uniform self-complementary hypergraphs of the order n. This characterization implies the well known results for self-complementing permutations of graphs,...

Self-conjugate vector partitions and the parity of the spt-function

George E. Andrews, Frank G. Garvan, Jie Liang (2013)

Acta Arithmetica

Let spt(n) denote the total number of appearances of the smallest parts in all the partitions of n. Recently, we found new combinatorial interpretations of congruences for the spt-function modulo 5 and 7. These interpretations were in terms of a restricted set of weighted vector partitions which we call S-partitions. We prove that the number of self-conjugate S-partitions, counted with a certain weight, is related to the coefficients of a certain mock theta function studied by the first author,...

Several q -series identities from the Euler expansions of ( a ; q ) ∞ and 1 ( a ; q ) ∞

Zhizheng Zhang, Yang, Jizhen (2009)

Archivum Mathematicum

In this paper, we first give several operator identities which extend the results of Chen and Liu, then make use of them to two q -series identities obtained by the Euler expansions of ( a ; q ) ∞ and 1 ( a ; q ) ∞ . Several q -series identities are obtained involving a q -series identity in Ramanujan’s Lost Notebook.

Currently displaying 1 – 20 of 158

Page 1 Next