Alexander Clifton

activity

20162023

most citedContinuously Increasing Subsequences of Random Multiset Permutations

1 citations · 2 across the 6 of their papers we have counts for

collaborators

Showing math.COShow all

8 papers · 1 filter

math.CO2023

Covering triangular grids with multiplicity

Abdul Basit, Alexander Clifton, Paul Horn

Motivated by classical work of Alon and Füredi, we introduce and address the following problem: determine the minimum number of affine hyperplanes in $R^{d}$ needed to cover…

math.CO2022

Reconstruction and Edge Reconstruction of Triangle-free Graphs

Alexander Clifton, Xiaonan Liu, Reem Mahmoud +1

The Reconstruction Conjecture due to Kelly and Ulam states that every graph with at least 3 vertices is uniquely determined by its multiset of subgraphs ${G - v : v \in V (G)}$ . Let $…

math.CO2022

Odd Covers of Graphs

Calum Buchanan, Alexander Clifton, Eric Culver +4

Given a finite simple graph $G$ , an odd cover of $G$ is a collection of complete bipartite graphs, or bicliques, in which each edge of $G$ appears in an odd number of bicliques and…

math.CO2021★ 1 cited

Continuously Increasing Subsequences of Random Multiset Permutations

Alexander Clifton, Bishal Deb, Yifeng Huang +2

For a word $π$ and integer $i$ , we define $L^{i} (π)$ to be the length of the longest subsequence of the form $i (i + 1) \dots j$ , and we let $L (π) := max_{i} L^{i} (π)$ . In this paper we esti…

math.CO2021

For a set of positive integers $D$ , a $k$ -term $D$ -diffsequence is a sequence of positive integers $a_{1} < a_{2} < \dots < a_{k}$ such that $a_{i} - a_{i - 1} \in D$ for $i = 2, 3, \dots, k$ . For $k\in…

math.CO2019

On almost k-covers of hypercubes

Alexander Clifton, Hao Huang

In this paper, we consider the following problem: what is the minimum number of affine hyperplanes in $R^{n}$ , such that all the vertices of $\{0, 1\}^n \setminus \{\vec{0}\…

math.CO2017

The canonical join complex for biclosed sets

Alexander Clifton, Peter Dillery, Alexander Garver

The canonical join complex of a semidistributive lattice is a simplicial complex whose faces are canonical join representations of elements of the semidistributive lattice. We give…

math.CO2016★ 1 cited

Coincidences among skew dual stable Grothendieck polynomials

Ethan Alwaise, Shuli Chen, Alexander Clifton +4

The question of when two skew Young diagrams produce the same skew Schur function has been well-studied. We investigate the same question in the case of stable Grothendieck polynom…