11 hasil untuk "Colin Defant"
Menampilkan 1–11 · 0,60 detik · RSS
-
Artikel Jurnal
Unitary Cayley graphs of Dedekind domain quotients
If X is a commutative ring with unity, then the unitary Cayley graph of X, denoted GX, is defined to be the graph whose vertex set is X and whose edge set is {{a,b}:a−b∈X×}. When R is a Dedekind domain and I is an ideal of R such that R/I is finite and nontrivial, we refer to GR/I as a generalized…
-
Artikel Jurnal
Proofs of Conjectures about Pattern-Avoiding Linear Extensions
After fixing a canonical ordering (or labeling) of the elements of a finite poset, one can associate each linear extension of the poset with a permutation. Some recent papers consider specific families of posets and ask how many linear extensions give rise to permutations that avoid certain…
-
Artikel Jurnal
Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
We give three applications of a recently-proven "Decomposition Lemma," which allows one to count preimages of certain sets of permutations under West's stack-sorting map $s$. We first enumerate the permutation class $s^{-1}(\text{Av}(231,321))=\text{Av}(2341,3241,45231)$, finding a new example of…
-
Artikel Jurnal
Binary Codes and Period-2 Orbits of Sequential Dynamical Systems
Let $[K_n,f,\pi]$ be the (global) SDS map of a sequential dynamical system (SDS) defined over the complete graph $K_n$ using the update order $\pi\in S_n$ in which all vertex functions are equal to the same function $f\colon\mathbb F_2^n\to\mathbb F_2^n$. Let $\eta_n$ denote the maximum number of…
-
Artikel Jurnal
Postorder Preimages
Given a set $Y$ of decreasing plane trees and a permutation $\pi$, how many trees in $Y$ have $\pi$ as their postorder? Using combinatorial and geometric constructions, we provide a method for answering this question for certain sets $Y$ and all permutations $\pi$. We then provide applications of…
-
Artikel Jurnal
Semidistrim Lattices
We introduce semidistrim lattices, a simultaneous generalization of semidistributive and trim lattices that preserves many of their common properties. We prove that the elements of a semidistrim lattice correspond to the independent sets in an associated graph called the Galois graph, that products…
-
Artikel Jurnal
Symmetry of Narayana Numbers and Rowvacuation of Root Posets
For a Weyl group W of rank r, the W-Catalan number is the number of antichains of the poset of positive roots, and the W-Narayana numbers refine the W-Catalan number by keeping track of the cardinalities of these antichains. The W-Narayana numbers are symmetric – that is, the number of antichains…
-
Artikel Jurnal
Anti-Ramsey theory on complete bipartite graphs
We consider quadruples of positive integers with and such that every proper edge-coloring of the complete bipartite graph contains a rainbow subgraph. We show that every such quadruple with and satisfies this property and find an infinite sequence where this bound is sharp. We also define and…
-
Artikel Jurnal
Bender–Knuth Billiards in Coxeter Groups
Let $(W,S)$ be a Coxeter system, and write $S=\{s_i:i\in I\}$ , where I is a finite index set. Fix a nonempty convex subset $\mathscr {L}$ of W. If W is of type A, then $\mathscr {L}$ is the set of linear extensions of a poset, and there are important Bender–Knuth involutions $\mathrm {BK}_i\colon…