Counting the number of isotone selfmappings of crowns

Letn>1. The number of all strictly increasing selfmappings of a 2n-element crown is . The number of all order-preserving selfmappings of a 2n-element crown is

The number of order-preserving maps of fences and crowns

We perform an exact enumeration of the order-preserving maps of fences (zig-zags) and crowns (cycles). From this we derive asymptotic results.     

The number of order-preserving maps between fences and crowns

We compute the number of order-preserving and -reversing maps between posets in the class of fences (zig-zags) and crowns (cycles).     

The number of positive weights of a quadrature formula

In this paper we show that the number of positive weights of a quadrature formula is related to the number of rotations of a certain path in the plane. Necessary and sufficient conditions for all weights to be positive can then be obtained. Also, much of classical theory appears in a new light.     

An algebraic formula for the intersection number of a polynomial immersion

An algorithm is presented for computing the topological degree for a large class of polynomial mappings. As an application there is given an effective algebraic formula for the intersection number of a polynomial immersion M→R^2m, where M is an m-dimensional algebraic manifold.     

An index formula for the self-linking number of a space curve

Given an embedded closed space curve with non-vanishing curvature, its self-linking number is defined as the linking number between the original curve and a curve pushed slightly off in the direction of its principal normals. We present an index formula for the self-linking number in terms of the writhe of a knot diagram of the curve and either (1) an index associated with the tangent indicatrix and its antipodal curve, (2) two indices associated with a stereographic projection of the tangent indicatrix, or (3) the rotation index (Whitney degree) of a stereographic projection of the tangent indicatrix minus the rotation index of the knot diagram.      

A formula for the number of Latin squares

We establish an explicit formula for the number of Latin squares of order n:

, where B_n is the set of n×n(0,1) matrices, σ₀(A is the number of zero elements of the matrix A and per A is the permanent of the matrix A.     

A new formula for winding number

We give a new formula for the winding number of smooth planar curves and show how this can be generalized to curves on closed orientable surfaces. This gives a geometric interpretation of the notion of winding number due to B. Reinhart and D.R.J. Chillingworth.     

A class number formula for the p-cyclotomic field

Let p be an odd prime number and . Let be the classical Stickelberger ideal of the group ring . Iwasawa [6] proved that the index equals the relative class number of . In [2], [4] we defined for each subgroup H of G a Stickelberger ideal of , and studied some of its properties. In this note, we prove that when mod 4 and [G : H] = 2, the index equals the quotient . Received: 13 January 2006     

A bijective proof of Jackson's formula for the number of factorizations of a cycle

Factorizations of the cyclic permutation into two permutations with respectively n and m cycles, or, equivalently, unicellular bicolored maps with N edges and n white and m black vertices, have been enumerated independantly by Jackson and Adrianov using evaluations of characters of the symmetric group. In this paper we present a bijection between unicellular partitioned bicolored maps and couples made of an ordered bicolored tree and a partial permutation, that allows for a combinatorial derivation of these results.Our work is closely related to a recent construction of Goulden and Nica for the celebrated Harer-Zagier formula, and indeed we provide a unified presentation of both bijections in terms of Eulerian tours in graphs.     

A new formula for the decycling number of regular graphs

The decycling number $?\left(G\right)$ of a graph $G$ is the smallest number of vertices which can be removed from $G$ so that the resultant graph contains no cycle. A decycling set containing exactly $?\left(G\right)$ vertices of $G$ is called a $?$-set. For any decycling set $S$ of a $k$-regular graph $G$, we show that $\left|S\right|=\frac{\beta \left(G\right)+m\left(S\right)}{k?1}$, where $\beta \left(G\right)$ is the cycle rank of $G$, $m\left(S\right)=c+\left|E\left(S\right)\right|?1$ is the margin number of $S$, $c$ and $\left|E\left(S\right)\right|$ are, respectively, the number of components of $G?S$ and the number of edges in $G\left[S\right]$. In particular, for any $?$-set $S$ of a 3-regular graph $G$, we prove that $m\left(S\right)=\xi \left(G\right)$, where $\xi \left(G\right)$ is the Betti deficiency of $G$. This implies that the decycling number of a 3-regular graph $G$ is $\frac{\beta \left(G\right)+\xi \left(G\right)}{2}$. Hence $?\left(G\right)=?\frac{\beta \left(G\right)}{2}?$ for a 3-regular upper-embeddable graph $G$, which concludes the results in [Gao et al., 2015, Wei and Li, 2013] and solves two open problems posed by Bau and Beineke (2002). Considering an algorithm by Furst et al., (1988), there exists a polynomial time algorithm to compute $Z\left(G\right)$, the cardinality of a maximum nonseparating independent set in a $3$-regular graph $G$, which solves an open problem raised by Speckenmeyer (1988). As for a 4-regular graph $G$, we show that for any $?$-set $S$ of $G$, there exists a spanning tree $T$ of $G$ such that the elements of $S$ are simply the leaves of $T$ with at most two exceptions providing $?\left(G\right)=?\frac{\beta \left(G\right)}{3}?$. On the other hand, if $G$ is a loopless graph on $n$ vertices with maximum degree at most $4$, then

The above two upper bounds are tight, and this makes an extension of a result due to Punnim (2006).     

On the number of summands in the asymptotic formula for the number of solutions to Waring's equation

In the paper, an estimate of the number of summands in the asymptotic formula for the number of solutions to Waring's equation is obtained. This is achieved by means of a recurrent process leading to a greater reduction than that in Vinogradov's mean value theorem.Translated fromMatematicheskie Zametki, Vol. 64, No. 2, pp. 285–296, August, 1998.The author wishes to thank N. M. Korobov for setting the problem and supervising his work.     

A lower bound for the number of nodes in the cubature formula for a centrally symmetric integral

Translated from Matematicheskie Zametki, Vol. 45, No. 5, pp. 70–75, May, 1989.     

Selberg trace formula for the Hilbert modular group of a real quadratic algebraic number field

In the paper the Selberg trace formula is derived for the Hilbert modular group of a real quadratic algebraic number field with one class of ideals, acting on the product of two upper semiplanes.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 100, pp. 26–47, 1980.