Searcharxiv⌕ Search

arXiv subjects

Godofredo Iommi Amunategui

Publications and source records attributed to Godofredo Iommi Amunategui.

8 recordsLinked to original sources

On Lie Groups and The Theory of Complex Variables

In this note we envisage the relation existing between the Lie Groups and the Theory of Complex Variables. In particular, it is shown that the dimensions of the irreducibles representations of $SU(N)$ may be written in terms of the Eisenstein integers and an identity is built up between the imaginary parts of the dimensions of the irreducible representations of the Lie Groups $SU(3)$ and $Sp(4)$.

math.HO↗

Symbolic Languages and Ars Combinatoria

This article analyses some paragraphs of the Dissertatio de Arte Combinatoria (1666) where G.W. Leibniz considers the syntax of a language with a given number of primitive terms. We propose a new formulation which generalizes the philosopher conception of such a formal system.

math.HO↗

La Dissertatio de Arte Combinatoria de Leibniz en seconde lecture

This article considers the Dissertatio de Arte Combinatoria, published in 1666 and relatively neglected by Leibniz s scholars. However in recent times the tide seems to be changing. Our work presents three main parts (sections II, III and IV, respectively). The first one exposes the contributions of M. Serres and E. Knobloch, viewed from our stand-point. The second one emphazises the role played by the symmetric group as the underlying mathematical structure of the Opus. Finally we treat the caput variationis which, in our opinion, is the fundamental concept of the Dissertatio. Moreover, it is suggested that the importance of such a theoretical insight may be traced in many aspects of Leibniz s subsequent thought.

math.HO↗

Nelson Goodman's qualia and the Discrete Cat Mapping

In The Structure of Appearance Nelson Goodman aims at describing the world as composed of individuals. He builds his system on phenomenal qualities or qualia. We propose a mathematical model for the qualia based on a dynamical system, the so-called Discrete Cat Mapping.

math.DS↗

An elementary non-recursive expression for the partition function P(n)

Consideration of a classification of the number of partitions of a natural number according to the members of sub-partitions differing from unity leads to a non-recursive formula for the number of irreducible representations of the symmetric group Sn. This article was published, long ago, under the title A non-recursive expression for the number of irreducible representations of the Symmetric Group Sn, Physica 114A, 1982, 361-364, North-Holland Publishing Co. The Introduction has been, somewhat, improved, however, the handmade result remains unproved.

math.CO↗

On Nelson Goodman's final formulae for Primary Complexity

In the Structure of Appearance and in Problems and Projects, Nelson Goodman has constructed a theory of complexity whose elements are the predicates of a system. One of his main results is a closed formula to evaluate v[n-pl], the maximum complexity value of an n-place predicate. Up to this day no procedure has been found to reduce v[n-pl], i.e., to write it in terms of (n-1)-place predicates. In this article we propose elementary combinatorial algorithms to carry out such a reduction.

math.CO↗