Bounds on the number of numerical semigroups of a given genus

Lower and upper bounds are given for the number n_g of numerical semigroups of genus g. The lower bound is the first known lower bound while the upper bound significantly improves the only known bound given by the Catalan numbers. In a previous work the sequence n_g is conjectured to behave asymptotically as the Fibonacci numbers. The lower bound proved in this work is related to the Fibonacci numbers and so the result seems to be in the direction to prove the conjecture. The method used is based on an accurate analysis of the tree of numerical semigroups and of the number of descendants of the descendants of each node depending on the number of descendants of the node itself.     

Atoms of the set of numerical semigroups with fixed Frobenius number

Given a positive integer g, we denote by F(g) the set of all numerical semigroups with Frobenius number g. The set (F(g),∩) is a semigroup. In this paper we study the generators of this semigroup.     

New upper bounds on the spectral radius of trees with the given number of vertices and maximum degree

This paper studies the problem of estimating the spectral radius of trees with the given number of vertices and maximum degree. We obtain the new upper bounds on the spectral radius of the trees, and the results are the best upper bounds expressed by the number of vertices and maximum degree, at present.     

Gaps in the number of generators of monomial Togliatti systems

Let $I_{d,n}?k[x_0,?,x_n]$ be a minimal monomial Togliatti system of forms of degree d. In [4], Mezzetti and Miró-Roig proved that the minimal number of generators $\mu (I_{d,n})$ of $I_{d,n}$ lies in the interval $[2n+1,\left(\begin{array}{c}n+d?1\\ n?1\end{array}\right)]$. In this paper, we prove that for $n\ge 4$ and $d\ge 3$, the integer values in $[2n+3,3n?1]$ cannot be realized as the number of minimal generators of a minimal monomial Togliatti system. We classify minimal monomial Togliatti systems $I_{d,n}?k[x_0,?,x_n]$ of forms of degree d with $\mu (I_{d,n})=2n+2$ or 3n (i.e. with the minimal number of generators reaching the border of the non-existence interval). Finally, we prove that for $n=4$, $d\ge 3$ and $\mu \in [9,\left(\begin{array}{c}d+3\\ 3\end{array}\right)]?\{11\}$ there exists a minimal monomial Togliatti system $I_{d,n}?k[x_0,?,x_n]$ of forms of degree d with $\mu (I_{n,d})=\mu$.     

On numerical semigroups and the order bound

Let S={s₀=0<s₁<?<s_i…}⊆N be a numerical non-ordinary semigroup; then set, for each . We find a non-negative integer m such that d_ORD(i)=ν_i+1 for i≥m, where d_ORD(i) denotes the order bound on the minimum distance of an algebraic geometry code associated to S. In several cases (including the acute ones, that have previously come up in the literature) we show that this integer m is the smallest one with the above property. Furthermore it is shown that every semigroup generated by an arithmetic sequence or generated by three elements is acute. For these semigroups, the value of m is also found.     

The Frobenius problem for numerical semigroups

In this paper, we characterize those numerical semigroups containing 〈n₁,n₂〉. From this characterization, we give formulas for the genus and the Frobenius number of a numerical semigroup. These results can be used to give a method for computing the genus and the Frobenius number of a numerical semigroup with embedding dimension three in terms of its minimal system of generators.     

Fibonacci-like behavior of the number of numerical semigroups of a given genus

We conjecture a Fibonacci-like property on the number of numerical semigroups of a given genus. Moreover we conjecture that the associated quotient sequence approaches the golden ratio. The conjecture is motivated by the results on the number of semigroups of genus at most 50. The Wilf conjecture has also been checked for all numerical semigroups with genus in the same range.     

“Catalan traffic” and integrals on the Grassmannian of lines

We prove that certain numbers occurring in a problem of paths enumeration, studied by Niederhausen in [Catalan traffic at the beach, Eletron. J. Combin. 9 (R33) (2002) 1-17] (see also [R.P. Stanley, Catalan addendum, version of 30 October 2005. 〈http://www-math.mit.edu/∼rstan/ec/catadd.pdf〉]), are top intersection numbers in the cohomology ring of the Grassmannian of the lines in the complex projective (n+1)- space.     

Nonnegative matrix semigroups with finite diagonals

Let S be a multiplicative semigroup of matrices with nonnegative entries. Assume that the diagonal entries of the members of S form a finite set. This paper is concerned with the following question: Under what circumstances can we deduce that S itself is finite?     

Hermitian matrices with a bounded number of eigenvalues

Conjugation covariants of matrices are applied to study the real algebraic variety consisting of complex Hermitian matrices with a bounded number of distinct eigenvalues. A minimal generating system of the vanishing ideal of degenerate three by three Hermitian matrices is given, and the structure of the corresponding coordinate ring as a module over the special unitary group is determined. The method applies also for degenerate real symmetric three by three matrices. For arbitrary n   partial information on the minimal degree component of the vanishing ideal of the variety of n×n$n\times n$ Hermitian matrices with a bounded number of eigenvalues is obtained, and some known results on sum of squares presentations of subdiscriminants of real symmetric matrices are extended to the case of complex Hermitian matrices.     

Improved lower bounds on the length of Davenport-Schinzel sequences

We derive lower bounds on the maximal length _s(n) of (n, s) Davenport Schinzel sequences. These bounds have the form _2s=1(n)=(n^s(n)), where(n) is the extremely slowly growing functional inverse of the Ackermann function. These bounds extend the nonlinear lower bound ₃ (n)=(n(n)) due to Hart and Sharir [5], and are obtained by an inductive construction based upon the construction given in [5].Work on this paper has been supported by Office of Naval Research Grant N00014-82-K-0381, National Science Foundation Grant No. NSF-DCR-83-20085, and by grants from the Digital Equipment Corporation, and the IBM Corporation.     

Constructing numerical semigroups of a given genus

Let n _g denote the number of numerical semigroups of genus g. Bras-Amorós conjectured that n _g possesses certain Fibonacci-like properties. Almost all previous attempts at proving this conjecture were based on analyzing the semigroup tree. We offer a new, simpler approach to counting numerical semigroups of a given genus. Our method gives direct constructions of families of numerical semigroups, without referring to the generators or the semigroup tree. In particular, we give an improved asymptotic lower bound for n _g .     

Positivity and matrix semigroups

We study various aspects of how certain positivity assumptions on complex matrix semigroups affect their structure. Our main result is that every irreducible group of complex matrices with nonnegative diagonal entries is simultaneously similar to a group of weighted permutations. We also consider the corresponding question for semigroups and discuss the effect of the assumption that a fixed linear functional has nonnegative values when restricted to a given semigroup.     

On computing the number of subgroups of a finite Abelian group

We consider the numberN _A (r) of subgroups of orderp ^r ofA, whereA is a finite Abelianp-group of type =₁,₂,..., _l ()), i.e. the direct sum of cyclic groups of order ⁱⁱ. Formulas for computingN _A (r) are well known. Here we derive a recurrence relation forN _A (r), which enables us to prove a conjecture of P. E. Dyubyuk about congruences betweenN _A (r) and the Gaussian binomial coefficient .     

Lower bounds for the game colouring number of partial k-trees and planar graphs

This paper discusses the game colouring number of partial k-trees and planar graphs. Let col_g(PT_k) and col_g(P) denote the maximum game colouring number of partial k trees and the maximum game colouring number of planar graphs, respectively. In this paper, we prove that col_g(PT_k)=3k+2 and col_g(P)?11. We also prove that the game colouring number col_g(G) of a graph is a monotone parameter, i.e., if H is a subgraph of G, then col_g(H)?col_g(G).     

New upper bounds for Estrada index of bipartite graphs

Suppose G is a graph and λ₁,λ₂,…,λ_n are the eigenvalues of G. The Estrada index EE(G) of G is defined as the sum of e^λ_i, 1≤i≤n. In this paper some new upper bounds for the Estrada index of bipartite graphs are presented. We apply our result on a (4,6)-fullerene to improve our bound given in an earlier paper.     

Principal topologies and transformation semigroups

For a given set X, the set F(X) of all maps from X to X forms a semigroup under composition. A subsemigroup S of F(X) is said to be saturated if for each x∈X there exists a set Ox⊆X with x∈Ox such that . It is shown that there exists a one-to-one correspondence between principal topologies on X and saturated subsemigroups of F(X). Some properties of principal topologies on X and the corresponding properties of their associated saturated subsemigroups of F(X) are discussed.