liu.seSearch for publications in DiVA
Change search
Refine search result
1 - 6 of 6
CiteExportLink to result list
Cite
Citation style
• apa
• harvard1
• ieee
• modern-language-association-8th-edition
• vancouver
• oxford
• Other style
More styles
Language
• de-DE
• en-GB
• en-US
• fi-FI
• nn-NO
• nn-NB
• sv-SE
• Other locale
More languages
Output format
• html
• text
• asciidoc
• rtf
Rows per page
• 5
• 10
• 20
• 50
• 100
• 250
Sort
• Standard (Relevance)
• Author A-Ö
• Author Ö-A
• Title A-Ö
• Title Ö-A
• Publication type A-Ö
• Publication type Ö-A
• Issued (Oldest first)
• Issued (Newest first)
• Created (Oldest first)
• Created (Newest first)
• Last updated (Oldest first)
• Last updated (Newest first)
• Disputation date (earliest first)
• Disputation date (latest first)
• Standard (Relevance)
• Author A-Ö
• Author Ö-A
• Title A-Ö
• Title Ö-A
• Publication type A-Ö
• Publication type Ö-A
• Issued (Oldest first)
• Issued (Newest first)
• Created (Oldest first)
• Created (Newest first)
• Last updated (Oldest first)
• Last updated (Newest first)
• Disputation date (earliest first)
• Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
• 1.
Linköping University, Department of Mathematics, Mathematics and Applied Mathematics.
Linköping University, Department of Mathematics, Mathematics and Applied Mathematics. Linköping University, Faculty of Science & Engineering. Linköping University, Department of Mathematics, Mathematics and Applied Mathematics. Linköping University, Faculty of Science & Engineering.
Topology of posets with special partial matchings2019In: Advances in Mathematics, ISSN 0001-8708, E-ISSN 1090-2082, Vol. 348, p. 255-276Article in journal (Refereed)

Special partial matchings (SPMs) are a generalisation of Brentis special matchings. Let a pircon be a poset in which every non-trivial principal order ideal is finite and admits an SPM. Thus pircons generalise Mariettis zircons. We prove that every open interval in a pircon is a PL ball or a PL sphere. It is then demonstrated that Bruhat orders on certain twisted identities and quasiparabolic W-sets constitute pircons. Together, these results extend a result of Can, Cherniaysky, and Twelbeck, prove a conjecture of Hultman, and confirm a claim of Rains and Vazirani.

• 2.
Linköping University, Department of Mathematics, Mathematics and Applied Mathematics. Linköping University, Faculty of Science & Engineering.
Combinatorics and topology related to involutions in Coxeter groups2018Doctoral thesis, comprehensive summary (Other academic)

This dissertation consists of three papers in combinatorial Coxeter group theory.

A Coxeter group is a group W generated by a set S, where all relations can be derived from the relations s2 = e for all s 𝜖 S, and (ss)m(s,s) = e for some pairs of generators s s in S, where e 𝜖 W is the identity element and m(s, s) is an integer satisfying that m(s, s) = m(s, s) ≥ 2. Two prominent examples of Coxeter groups are provided by the symmetric group Sn (i.e., the set of permutations of {1, 2, . . . , n}) and finite reflection groups (i.e., finite groups generated by reflections in some real euclidean space). There are also important infinite Coxeter groups, e.g., affine reflection groups.

Every Coxeter group can be equipped with various natural partial orders, the most important of which is the Bruhat order. Any subset of a Coxeter group can then be viewed as an induced subposet.

In Paper A, we study certain posets of this kind, namely, unions of conjugacy classes of involutions in the symmetric group. We obtain a complete classification of the posets that are pure (i.e., all maximal chains have the same length). In particular, we prove that the set of involutions with exactly one fixed point is pure, which settles a conjecture of Hultman in the affirmative. When the posets are pure, we give their rank functions. We also give a short, new proof of the EL-shellability of the set of fixed-point-free involutions, established by Can, Cherniavsky, and Twelbeck.

Paper B also deals with involutions in Coxeter groups. Given an involutive automorphism θ of a Coxeter system (W, S), let

ℑ(θ) = {w 𝜖 W | θ(w) = w−1}

be the set of twisted involutions. In particular, ℑ(id) is the set of ordinary involutions in W. It is known that twisted involutions can be represented by words in the alphabet $\underline{s}$ = {$\small\underline{s}$ | s 𝜖 S}, called $\underline{s}$ -expressions. If ss has finite order m(s, s), let a braid move be the replacement of $\small\underline{s}$ $\small\underline{s}$$\small\underline{s}$ by $\small\underline{s}$$\small\underline{s}$ $\small\underline{s}$ ⋯, both consisting of m(s, s) letters. We prove a word property for ℑ(θ), for any Coxeter system (W, S) with any θ. More precisely, we provide a minimal set of moves, easily determined from the Coxeter graph of (W, S), that can be added to the braid moves in order to connect all reduced $\underline{s}$-expressions for any given w 𝜖 ℑ(θ). This improves upon a result of Hamaker, Marberg, and Pawlowski, and generalises similar statements valid in certain types due to Hu, Zhang, Wu, and Marberg.

In Paper C, we investigate the topology of (the order complexes of) certain posets, called pircons. A special partial matching (SPM) on a poset is a matching of the Hasse diagram satisfying certain extra conditions. An SPM without fixed points is precisely a special matching as defined by Brenti. Let a pircon be a poset in which every non-trivial principal order ideal is finite and admits an SPM. Thus pircons generalise Marietti’s zircons. Our main result is that every open interval in a pircon is a PL ball or a PL sphere.

An important subset of ℑ(θ) is the set 𝜄(θ) = {θ(w−1)w | w 𝜖 W} of twisted identities. We prove that if θ does not flip any edges with odd labels in the Coxeter graph, then 𝜄(θ), with the order induced by the Bruhat order on W, is a pircon. Hence, its open intervals are PL balls or spheres, which confirms a conjecture of Hultman. It is also demonstrated that Bruhat orders on Rains and Vazirani’s quasiparabolic W-sets (under a boundedness assumption) form pircons. In particular, this applies to all parabolic quotients of Coxeter groups.

1. The Bruhat order on conjugation-invariant sets of involutions in the symmetric group
Open this publication in new window or tab >>The Bruhat order on conjugation-invariant sets of involutions in the symmetric group
2016 (English)In: Journal of Algebraic Combinatorics, ISSN 0925-9899, E-ISSN 1572-9192, Vol. 44, no 4, p. 849-862Article in journal (Refereed) Published
##### Abstract [en]

Let In be the set of involutions in the symmetric group Sn, and for A $\small\subseteq$ {0, 1, . . . , n}, let

$\small F _{n}^A$ = {$\sigma$$\in$ In$\sigma$ has α fixed points for some α $\in$  A}.

We give a complete characterisation of the sets A for which $\small F _{n}^A$, with the order induced by the Bruhat order on Sn, is a graded poset. In particular, we prove that $\small F _{n}^\lbrace^1^\rbrace$ (i.e., the set of involutions with exactly one fixed point) is graded, which settles a conjecture of Hultman in the affirmative. When $\small F _{n}^A$ is graded, we give its rank function. We also give a short, new proof of the EL-shellability of $\small F _{n}^\lbrace^0^\rbrace$ (i.e., the set of fixed-point-free involutions), recently proved by Can, Cherniavsky, and Twelbeck.

##### Place, publisher, year, edition, pages
Springer, 2016
##### Keywords
Bruhat order, symmetric group, involution, conjugacy class, graded poset, EL-shellability
Mathematics
##### Identifiers
urn:nbn:se:liu:diva-123043 (URN)10.1007/s10801-016-0691-9 (DOI)000387223300002 ()
##### Note

At the time for thesis presentation publication was in status: Manuscript

Available from: 2015-12-03 Created: 2015-12-03 Last updated: 2018-05-21Bibliographically approved
• 3.
Linköping University, Department of Mathematics, Mathematics and Applied Mathematics. Linköping University, Faculty of Science & Engineering.
Generalised Ramsey numbers and Bruhat order on involutions2015Licentiate thesis, comprehensive summary (Other academic)

This thesis consists of two papers within two different areas of  combinatorics.

Ramsey theory is a classic topic in graph theory, and Paper A deals with two of its most fundamental problems: to compute Ramsey numbers and to characterise critical graphs. More precisely, we study generalised Ramsey numbers for two sets Γ1 and Γ2 of cycles. We determine, in particular, all generalised Ramsey numbers R(Γ1, Γ2) such that Γ1 or Γ2 contains a cycle of length at most 6, or the shortest cycle in each set is even. This generalises previous results of Erdös, Faudree, Rosta, Rousseau, and Schelp. Furthermore, we give a conjecture for the general case. We also characterise many (Γ1, Γ2)-critical graphs. As special cases, we obtain complete characterisations of all (Cn,C3)-critical graphs for n ≥ 5, and all (Cn,C5)-critical graphs for n ≥ 6.

In Paper B, we study the combinatorics of certain partially ordered sets. These posets are unions of conjugacy classes of involutions in the symmetric group Sn, with the order induced by the Bruhat order on Sn. We obtain a complete characterisation of the posets that are graded. In particular, we prove that the set of involutions with exactly one fixed point is graded, which settles a conjecture of Hultman in the affirmative. When the posets are graded, we give their rank functions. We also give a short, new proof of the EL-shellability of the set of fixed-point-free involutions, recently proved by Can, Cherniavsky, and Twelbeck.

1. Generalised Ramsey numbers for two sets of cycles
Open this publication in new window or tab >>Generalised Ramsey numbers for two sets of cycles
(English)Manuscript (preprint) (Other academic)
##### Abstract [en]

We determine several generalised Ramsey numbers for two sets Γ1 and Γ2 of cycles, in particular, all generalised Ramsey numbers R(Γ1, Γ2) such that Γ1 or Γ2 contains a cycle of length at most 6, or the shortest cycle in each set is even. This generalises previous results of Erdös, Faudree, Rosta, Rousseau, and Schelp from the 1970s. Notably, including both C3 and C4 in one of the sets, makes very little difference from including only C4. Furthermore, we give a conjecture for the general case. We also describe many (Γ1, Γ2)-avoiding graphs, including a complete characterisation of most (Γ1, Γ2)-critical graphs, i.e., (Γ1, Γ2)-avoiding graphs on R(Γ1, Γ2) − 1 vertices, such that Γ1 or Γ2 contains a cycle of length at most 5. For length 4, this is an easy extension of a recent result of Wu, Sun, and Radziszowski, in which |Γ1| = |Γ2| = 1. For lengths 3 and 5, our results are new even in this special case.

##### Keywords
Generalised Ramsey number, critical graph, cycle, set of cycles
Mathematics
##### Identifiers
urn:nbn:se:liu:diva-123042 (URN)
Available from: 2015-12-03 Created: 2015-12-03 Last updated: 2015-12-03Bibliographically approved
2. The Bruhat order on conjugation-invariant sets of involutions in the symmetric group
Open this publication in new window or tab >>The Bruhat order on conjugation-invariant sets of involutions in the symmetric group
2016 (English)In: Journal of Algebraic Combinatorics, ISSN 0925-9899, E-ISSN 1572-9192, Vol. 44, no 4, p. 849-862Article in journal (Refereed) Published
##### Abstract [en]

Let In be the set of involutions in the symmetric group Sn, and for A $\small\subseteq$ {0, 1, . . . , n}, let

$\small F _{n}^A$ = {$\sigma$$\in$ In$\sigma$ has α fixed points for some α $\in$  A}.

We give a complete characterisation of the sets A for which $\small F _{n}^A$, with the order induced by the Bruhat order on Sn, is a graded poset. In particular, we prove that $\small F _{n}^\lbrace^1^\rbrace$ (i.e., the set of involutions with exactly one fixed point) is graded, which settles a conjecture of Hultman in the affirmative. When $\small F _{n}^A$ is graded, we give its rank function. We also give a short, new proof of the EL-shellability of $\small F _{n}^\lbrace^0^\rbrace$ (i.e., the set of fixed-point-free involutions), recently proved by Can, Cherniavsky, and Twelbeck.

##### Place, publisher, year, edition, pages
Springer, 2016
##### Keywords
Bruhat order, symmetric group, involution, conjugacy class, graded poset, EL-shellability
Mathematics
##### Identifiers
urn:nbn:se:liu:diva-123043 (URN)10.1007/s10801-016-0691-9 (DOI)000387223300002 ()
##### Note

At the time for thesis presentation publication was in status: Manuscript

Available from: 2015-12-03 Created: 2015-12-03 Last updated: 2018-05-21Bibliographically approved
• 4.
Linköping University, Department of Mathematics, Mathematics and Applied Mathematics. Linköping University, Faculty of Science & Engineering.
Generalised Ramsey numbers for two sets of cyclesManuscript (preprint) (Other academic)

We determine several generalised Ramsey numbers for two sets Γ1 and Γ2 of cycles, in particular, all generalised Ramsey numbers R(Γ1, Γ2) such that Γ1 or Γ2 contains a cycle of length at most 6, or the shortest cycle in each set is even. This generalises previous results of Erdös, Faudree, Rosta, Rousseau, and Schelp from the 1970s. Notably, including both C3 and C4 in one of the sets, makes very little difference from including only C4. Furthermore, we give a conjecture for the general case. We also describe many (Γ1, Γ2)-avoiding graphs, including a complete characterisation of most (Γ1, Γ2)-critical graphs, i.e., (Γ1, Γ2)-avoiding graphs on R(Γ1, Γ2) − 1 vertices, such that Γ1 or Γ2 contains a cycle of length at most 5. For length 4, this is an easy extension of a recent result of Wu, Sun, and Radziszowski, in which |Γ1| = |Γ2| = 1. For lengths 3 and 5, our results are new even in this special case.

• 5.
Linköping University, Department of Mathematics, Mathematics and Applied Mathematics. Linköping University, Faculty of Science & Engineering.
Generalised Ramsey numbers for two sets of cycles2018In: Discrete Applied Mathematics, ISSN 0166-218X, E-ISSN 1872-6771, Vol. 238, p. 86-94Article in journal (Refereed)

Let C-1 and C-2 be two sets of cycles. We determine all generalised Ramsey numbers R(C-1, C-2) such that C-1 or C-2 contains a cycle of length at most 6. This generalises previous results of Erdos, Faudree, Rosta, Rousseau, and Schelp. Furthermore, we give a conjecture for the general case. We also provide a complete classification of most (C-1, C-2)-critical graphs such that C-1 or C-2 contains a cycle of length at most 5. For length 4, this is an easy extension of a recent result of Wu, Sun, and Radziszowski, in which vertical bar C-1 vertical bar = vertical bar C-2 vertical bar = 1. For lengths 3 and 5, our results are new also in this special case. (C) 2017 Elsevier B.V. All rights reserved.

The full text will be freely available from 2020-01-06 13:08
• 6.
Linköping University, Department of Mathematics, Mathematics and Applied Mathematics. Linköping University, Faculty of Science & Engineering.
The Bruhat order on conjugation-invariant sets of involutions in the symmetric group2016In: Journal of Algebraic Combinatorics, ISSN 0925-9899, E-ISSN 1572-9192, Vol. 44, no 4, p. 849-862Article in journal (Refereed)

Let In be the set of involutions in the symmetric group Sn, and for A $\small\subseteq$ {0, 1, . . . , n}, let

$\small F _{n}^A$ = {$\sigma$$\in$ In$\sigma$ has α fixed points for some α $\in$  A}.

We give a complete characterisation of the sets A for which $\small F _{n}^A$, with the order induced by the Bruhat order on Sn, is a graded poset. In particular, we prove that $\small F _{n}^\lbrace^1^\rbrace$ (i.e., the set of involutions with exactly one fixed point) is graded, which settles a conjecture of Hultman in the affirmative. When $\small F _{n}^A$ is graded, we give its rank function. We also give a short, new proof of the EL-shellability of $\small F _{n}^\lbrace^0^\rbrace$ (i.e., the set of fixed-point-free involutions), recently proved by Can, Cherniavsky, and Twelbeck.

1 - 6 of 6
CiteExportLink to result list
Cite
Citation style
• apa
• harvard1
• ieee
• modern-language-association-8th-edition
• vancouver
• oxford
• Other style
More styles
Language
• de-DE
• en-GB
• en-US
• fi-FI
• nn-NO
• nn-NB
• sv-SE
• Other locale
More languages
Output format
• html
• text
• asciidoc
• rtf