EuDML | Browse

Items

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

Previous Page 2 Next

Displaying 21 – 40 of 108

Combinatorial formulae for multiple set-valued labellings.

Mau-Hsiang Shih, Shyh-Nan Lee (1993)

Mathematische Annalen

Completely dissociative groupoids

Milton Braitt, David Hobby, Donald Silberger (2012)

Mathematica Bohemica

In a groupoid, consider arbitrarily parenthesized expressions on the $k$ variables $x_{0}, x_{1}, \dots x_{k - 1}$ where each $x_{i}$ appears once and all variables appear in order of their indices. We call these expressions $k$ -ary formal products, and denote the set containing all of them by $F^{σ} (k)$ . If $u, v \in F^{σ} (k)$ are distinct, the statement that $u$ and $v$ are equal for all values of $x_{0}, x_{1}, \dots x_{k - 1}$ is a generalized associative law. Among other results, we show that many small groupoids are completely dissociative, meaning that no generalized associative law holds...

Conditions on periodicity for sum-free sets.

Calkin, Neil J., Finch, Steven R. (1996)

Experimental Mathematics

Connections between the matching and chromatic polynomials.

Farrell, E.J., Whitehead, Earl Glen jun. (1992)

International Journal of Mathematics and Mathematical Sciences

Counterexamples to the Neggers-Stanley conjecture.

Brändén, Petter (2004)

Electronic Research Announcements of the American Mathematical Society [electronic only]

Diagonal peg solitaire.

Bell, George I. (2007)

Integers

ECO species.

Ferrari, Luca, Leroux, Pierre (2009)

Séminaire Lotharingien de Combinatoire [electronic only]

Eine gruppentheoretische Methode in der Musiktheorie

Edwin Hewitt, G.D. Halsey (1978)

Jahresbericht der Deutschen Mathematiker-Vereinigung

Enumeration of alternating sign matrices of even size (quasi-)Invariant under a quarter-turn rotation.

Aval, Jean-Christophe, Duchon, Philippe (2010)

The Electronic Journal of Combinatorics [electronic only]

Enumeration under group action

Gian-Carlo Rota, David A. Smith (1977)

Annali della Scuola Normale Superiore di Pisa - Classe di Scienze

Escaliers évalués et nombres classiques.

Han, Guoniu (1990)

Séminaire Lotharingien de Combinatoire [electronic only]

Extensions of the Graham-Leeb-Rothschild theorem.

Bernd Voigt (1985)

Journal für die reine und angewandte Mathematik

From a Ramsey-type theorem to indepedence

Joanna Jureczko, Marian Turzański (2008)

Acta Universitatis Carolinae. Mathematica et Physica

General numeration I. Gauged schemes.

D. W. Dubois (1982)

Revista Matemática Hispanoamericana

The paper deals with special partitions of whole numbers in the following form: given a sequence of pairs {[Gi;Di]} of positive integers in which the Gi form a strictly increasing sequence, sums of the form ∑niGi, with 0 ≤ ni ≤ Di, are considered. The correspondence[nk ... n0] → ∑i≤k niGidefines then a mapping α from a set M of numerals, called Neugebauer symbols, satisfying 0 ≤ ni ≤ Di, into the set W of all non-negative integers. In M, initial zeros are supressed and M is ordered in the usual...

Generating random elements of finite distributive lattices.

Propp, James (1997)

The Electronic Journal of Combinatorics [electronic only]

Geometry of links.

Jablan, Slavik V. (1999)

Novi Sad Journal of Mathematics

Graphs $S (n, k)$ and a variant of the Tower of Hanoi problem

Sandi Klavžar, Uroš Milutinović (1997)

Czechoslovak Mathematical Journal

For any $n \geq 1$ and any $k \geq 1$ , a graph $S (n, k)$ is introduced. Vertices of $S (n, k)$ are $n$ -tuples over ${1, 2, ..., k}$ and two $n$ -tuples are adjacent if they are in a certain relation. These graphs are graphs of a particular variant of the Tower of Hanoi problem. Namely, the graphs $S (n, 3)$ are isomorphic to the graphs of the Tower of Hanoi problem. It is proved that there are at most two shortest paths between any two vertices of $S (n, k)$ . Together with a formula for the distance, this result is used to compute the distance between two vertices in...

Currently displaying 21 – 40 of 108