Skip to main content

EN
ÍS

Forsíða

Forsíða

Anders Karl Claesson - Professor

Anders Karl Claesson

–

School of Engineering and Natural Sciences

Anders Karl Claesson

Professor

Location
Tæknigarður / Tg-327
Phone
525 - 4662
Email
akc [at] hi.is

Unit
Faculty of Physical Sciences
Website
http://akc.is/

Published works

2024

Caylerian polynomialsDiscrete Mathematics
Turning cycle restrictions into mesh patterns via Foata's fundamental transformationDiscrete Mathematics
Restricted Permutations Enumerated by InversionsElectronic Proceedings in Theoretical Computer Science, EPTCS

2023

Fishburn treesAdvances in Applied Mathematics
Transport of patterns by Burge transposeEuropean Journal of Combinatorics
COUNTING TOURNAMENT SCORE SEQUENCESProceedings of the American Mathematical Society
Permutations with few inversionsElectronic Journal of Combinatorics
Weak ascent sequences and related combinatorial structuresEuropean Journal of Combinatorics

2022

From Hertzsprung's problem to pattern-rewriting systemsAlgebraic Combinatorics

2021

Counting Pop-Stacked Permutations in Polynomial TimeExperimental Mathematics

2020

Sorting with pattern-avoiding stacksElectronic Journal of Combinatorics
A species approach to Rota's twelvefold wayExpositiones Mathematicae
Stack sorting with restricted stacksJournal of Combinatorial Theory. Series A

2019

Enumerating permutations sortable by k passes through a pop-stackAdvances in Applied Mathematics

2018

Enumerating permutations sortable by k passes through a pop-stack

2017

Simultaneous Avoidance of a Vincular and a Covincular, Pattern of Length 3Journal of Integer Sequences

2015

Isomorphisms between pattern classesJOURNAL OF COMBINATORICS
Design methodology applied for product innovation in a multi-disciplinary project - A case studyProceedings of the International Conference on Engineering Design, ICED
Coincidence among families of mesh patternsAustralasian Journal of Combinatorics
An involution on bicubic maps and β(0,1)-treesAustralasian Journal of Combinatorics

2014

Decomposing labeled interval orders as pairs of permutationsElectronic Journal of Combinatorics

2013

An involution on β (1, 0) -treesAdvances in Applied Mathematics

2012

Sorting and preimages of pattern classesDiscrete Mathematics and Theoretical Computer Science
Upper bounds for the Stanley-Wilf limit of 1324 and other layered patternsJournal of Combinatorial Theory. Series A

2011

A direct encoding of stoimenow's matchings as ascent sequencesAustralasian Journal of Combinatorics
Partition and composition matrices
On the inverse image of pattern classes under bubble sortJOURNAL OF COMBINATORICS
N! matchings, n! posetsProceedings of the American Mathematical Society
Integrated product and production model-issues on completeness, consistency and compatibility
Partition and composition matricesJournal of Combinatorial Theory. Series A
Pattern avoidance in partial permutationsElectronic Journal of Combinatorics
Mesh patterns and the expansion of permutation statistics as sums of permutation patternsElectronic Journal of Combinatorics

2010

Boolean complexes for Ferrers graphsAustralasian Journal of Combinatorics
(2+2)-free posets, ascent sequences and pattern avoiding permutationsJournal of Combinatorial Theory. Series A
N! matchings, n! posets (extended abstract)
Pattern avoidance in partial permutations (extended abstract)
Descent polynomials for permutations with bounded drop sizeEuropean Journal of Combinatorics
Permutations sortable by n - 4 passes through a stackAnnals of Combinatorics
Descent polynomials for permutations with bounded drop size

2009

Unlabeled (2 + 2)-free posets, ascent sequences and pattern avoiding permutations
Decompositions and statistics for β (1, 0)-trees and nonseparable permutationsAdvances in Applied Mathematics

2008

Classification of bijections between 321- and 132-avoiding permutations

2007

Conway's Napkin problemAmerican Mathematical Monthly

2006

Integrated and configurable product and manufacturing system models
A configurable component framework supporting platform-based product developmentDoktorsavhandlingar vid Chalmers Tekniska Hogskola

2005

Systematic product platform designJournal of Engineering Design
Utilising the concept of a design's bandwidth to achieve product platform effectiveness
Capturing design knowledge of robust designs using configurable components
Enumerating permutations avoiding a pair of Babson-steingrímsson patternsArs Combinatoria
Counting segmented permutations using bicoloured Dyck pathsElectronic Journal of Combinatorics

2004

Permutation patterns, continued fractions, and a group determined by an ordered setDoktorsavhandlingar vid Chalmers Tekniska Hogskola

2003

A permutation group determined by an ordered setDiscrete Mathematics
Product description using configurable components

2002

Catalan continued fractions and increasing subsequences in permutationsDiscrete Mathematics
Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutationsAdvances in Applied Mathematics

2001

Generalized Pattern AvoidanceEuropean Journal of Combinatorics
Platform product development

Keywords for Specialisation:

Enumerative Combinatorics