Results 71 to 80 of about 3,991 (224)
On the automorphisms of the power semigroups of a numerical semigroup
Abstract If H$H$ is a numerical semigroup (i.e., a cofinite subset of the non‐negative integers closed under addition), then the collection of all non‐empty subsets of H$H$ forms a semigroup P(H)$\mathcal {P}(H)$ under the sumset operation induced by addition in H$H$.
Salvatore Tringali, Kerou Wen
wiley +1 more source
This is an introductory course in algebraic combinatorics. No prior knowledge of combinatorics is expected, but assumes a familiarity with linear algebra and finite groups.
Musiker, Gregg
core
Triangular arrangements on the projective plane [PDF]
In this work we study line arrangements consisting in lines passing through three non-aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a Roots-of-Unity-Arrangement ...
Simone Marchesi, Jean Vallès
doaj
Colourings of Uniform Group Divisible Designs and Maximum Packings
ABSTRACT A weak c‐colouring of a design is an assignment of colours to its points from a set of c available colours, such that there are no monochromatic blocks. A colouring of a design is block‐equitable, if for each block, the number of points coloured with any available pair of colours differ by at most one.
Andrea C. Burgess +6 more
wiley +1 more source
Applications of algebra to combinatorics and conversely. Topics include enumeration methods, partially ordered sets and lattices, matching theory, partitions and tableaux, algebraic graph theory, and combinatorics of ...
Postnikov, Alexander
core
Structure and Combinatorics on Right Groups
Right groups form an important bridge between group theory and semigroup theory, combining the algebraic symmetry of groups with the one-sided structure of right zero semigroups.
Aftab Hussain Shah +2 more
doaj +1 more source
Weak, Strong and Mixed Extensions of Relations to Spaces of Ultrafilters
ABSTRACT The use of nonstandard methods to characterize properties of weak, strong and mixed extensions of congruences to ultrafilters has been the main topic of several recent papers, focused mostly on congruences and divisions. We show that similar methods can be used to extend these characterizations to arbitrary relations and their interplay.
Leonardo Raffaello Maximilian Gasparro +1 more
wiley +1 more source
International Journal of Mathematical Combinatorics, Vol.7A [PDF]
The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
Is It Easier to Count Communities Than Find Them?
ABSTRACT Random graph models with community structure have been studied extensively in the literature. For both the problems of detecting and recovering community structure, an interesting landscape of statistical and computational phase transitions has emerged. A natural unanswered question is: Might it be possible to infer properties of the community
Cynthia Rush +3 more
wiley +1 more source
AUTOMORPHISM GROUPS OF MAPS, SURFACES AND SMARANDACHE GEOMETRIES [PDF]
Automorphism groups survey similarities on mathematical systems, which appear nearly in all mathematical branches, such as those of algebra, combinatorics, geometry, · · · and theoretical physics, theoretical chemistry, etc..
MAO, LINFAN
core +1 more source

