Real subset sums and posets with an involution

In this paper, we carry out in an abstract order context some real subset combinatorial problems. Specifically, let [Formula: see text] be a finite poset, where [Formula: see text] is an order-reversing and involutive map such that [Formula: see text] for each [Formula: see text]. Let [Formula: see text] be the Boolean lattice with two elements and [Formula: see text] the family of all the order-preserving 2-valued maps [Formula: see text] such that [Formula: see text] if [Formula: see text] for all [Formula: see text]. In this paper, we build a family [Formula: see text] of particular subsets of [Formula: see text], that we call [Formula: see text]-bases on [Formula: see text], and we determine a bijection between the family [Formula: see text] and the family [Formula: see text]. In such a bijection, a [Formula: see text]-basis [Formula: see text] on [Formula: see text] corresponds to a map [Formula: see text] whose restriction of [Formula: see text] to [Formula: see text] is the smallest 2-valued partial map on [Formula: see text] which has [Formula: see text] as its unique extension in [Formula: see text]. Next we show how each [Formula: see text]-basis on [Formula: see text] becomes, in a particular context, a sub-system of a larger system of linear inequalities, whose compatibility implies the compatibility of the whole system.

Reduced finitary incidence algebras and their automorphisms

Let [Formula: see text] denote the incidence algebra of a locally finite poset [Formula: see text] over a field [Formula: see text] and [Formula: see text] some equivalence relation on the set of generators of [Formula: see text]. Then [Formula: see text] is the subset of [Formula: see text] of all the elements that are constant on the equivalence classes of [Formula: see text]. If [Formula: see text] satisfies certain conditions, then [Formula: see text] is a subalgebra of [Formula: see text] called a reduced incidence algebra. We extend this notion to finitary incidence algebras [Formula: see text] for any poset [Formula: see text]. We investigate reduced finitary incidence algebras [Formula: see text] and determine their automorphisms in some special cases.

The “k = 1” Case of a Problem of Greene and Kleitman from 1976: Join-Irreducible Elements in the Lattice of Sperner 1-Families

Let k ≥ 1. A Sperner k-family is a maximum-sized subset of a finite poset that contains no chain with k + 1 elements. In 1976 Greene and Kleitman defined a lattice-ordering on the set Sk(P) of Sperner k-families of a fifinite poset P and posed the problem: “Characterize and interpret the join- and meet-irreducible elements of Sk(P),” adding, “This has apparently not been done even for the case k = 1.”In this article, the case k = 1 is done.

Supersaturation, Counting, and Randomness in Forbidden Subposet Problems

In the area of forbidden subposet problems we look for the largest possible size $La(n,P)$ of a family $\mathcal{F}\subseteq 2^{[n]}$ that does not contain a forbidden inclusion pattern described by $P$. The main conjecture of the area states that for any finite poset $P$ there exists an integer $e(P)$ such that $La(n,P)=(e(P)+o(1))\binom{n}{\lfloor n/2\rfloor}$. In this paper, we formulate three strengthenings of this conjecture and prove them for some specific classes of posets. (The parameters $x(P)$ and $d(P)$ are defined in the paper.) For any finite connected poset $P$ and $\varepsilon>0$, there exists $\delta>0$ and an integer $x(P)$ such that for any $n$ large enough, and $\mathcal{F}\subseteq 2^{[n]}$ of size $(e(P)+\varepsilon)\binom{n}{\lfloor n/2\rfloor}$, $\mathcal{F}$ contains at least $\delta n^{x(P)}\binom{n}{\lfloor n/2\rfloor}$ copies of $P$. The number of $P$-free families in $2^{[n]}$ is $2^{(e(P)+o(1))\binom{n}{\lfloor n/2\rfloor}}$. Let $\mathcal{P}(n,p)$ be the random subfamily of $2^{[n]}$ such that every $F\in 2^{[n]}$ belongs to $\mathcal{P}(n,p)$ with probability $p$ independently of all other subsets $F'\in 2^{[n]}$. For any finite poset $P$, there exists a positive rational $d(P)$ such that if $p=\omega(n^{-d(P)})$, then the size of the largest $P$-free family in $\mathcal{P}(n,p)$ is $(e(P)+o(1))p\binom{n}{\lfloor n/2\rfloor}$ with high probability.

Birational Rowmotion and Coxeter-Motion on Minuscule Posets

Birational rowmotion is a discrete dynamical system on the set of all positive real-valued functions on a finite poset, which is a birational lift of combinatorial rowmotion on order ideals. It is known that combinatorial rowmotion for a minuscule poset has order equal to the Coxeter number, and exhibits the file homomesy phenomenon for refined order ideal cardinality statistics. In this paper we generalize these results to the birational setting. Moreover, as a generalization of birational promotion on a product of two chains, we introduce birational Coxeter-motion on minuscule posets, and prove that it enjoys periodicity and file homomesy.

Isomorphisms of subcategories of fusion systems of blocks and Clifford theory

Let k be an algebraically closed field of prime characteristic p. Let G be a finite group, let N be a normal subgroup of G, and let c be a G-stable block of kN so that {(kN)c} is a p-permutation G-algebra. As in Section 8.6 of [M. Linckelmann, The Block Theory of finite Group Algebras: Volume 2, London Math. Soc. Stud. Texts 92, Cambridge University, Cambridge, 2018], a {(G,N,c)}-Brauer pair {(R,f_{R})} consists of a p-subgroup R of G and a block {f_{R}} of {(kC_{N}(R))}. If Q is a defect group of c and {f_{Q}\in\operatorname{\textit{B}\ell}(kC_{N}(Q))}, then {(Q,f_{Q})} is a {(G,N,c)}-Brauer pair. The {(G,N,c)}-Brauer pairs form a (finite) poset. Set {H=N_{G}(Q,f_{Q})} so that {(Q,f_{Q})} is an {(H,C_{N}(Q),f_{Q})}-Brauer pair. We extend Lemma 8.6.4 of the above book to show that if {(U,f_{U})} is a maximal {(G,N,c)}-Brauer pair containing {(Q,f_{Q})}, then {(U,f_{U})} is a maximal {(H,C_{N}(c),f_{Q})}-Brauer pair containing {(Q,f_{Q})} and conversely. Our main result shows that the subcategories of {\mathcal{F}_{(U,f_{U})}(G,N,c)} and {\mathcal{F}_{(U,f_{U})}(H,C_{N}(Q),f_{Q})} of objects between and including {(Q,f_{Q})} and {(U,f_{U})} are isomorphic. We close with an application to the Clifford theory of blocks.

Improved Bounds for Induced Poset Saturation

Given a finite poset $\mathcal{P}$, a family $\mathcal{F}$ of elements in the Boolean lattice is induced-$\mathcal{P}$-saturated if $\mathcal{F}$ contains no copy of $\mathcal{P}$ as an induced subposet but every proper superset of $\mathcal{F}$ contains a copy of $\mathcal{P}$ as an induced subposet. The minimum size of an induced-$\mathcal{P}$-saturated family in the $n$-dimensional Boolean lattice, denoted $\mathrm{sat}^*(n,\mathcal{P})$, was first studied by Ferrara et al. (2017). Our work focuses on strengthening lower bounds. For the 4-point poset known as the diamond, we prove $\mathrm{sat}^*(n,\Diamond)\geq\sqrt{n}$, improving upon a logarithmic lower bound. For the antichain with $k+1$ elements, we prove $$\mathrm{sat}^*(n,\mathcal{A}_{k+1})\geq \left(1-\frac{1}{\log_2k}\right)\frac{kn}{\log_2 k}$$ for $n$ sufficiently large, improving upon a lower bound of $3n-1$ for $k\geq 3$.

Wilf’s conjecture in fixed multiplicity

We give an algorithm to determine whether Wilf’s conjecture holds for all numerical semigroups with a given multiplicity [Formula: see text], and use it to prove Wilf’s conjecture holds whenever [Formula: see text]. Our algorithm utilizes techniques from polyhedral geometry, and includes a parallelizable algorithm for enumerating the faces of any polyhedral cone up to orbits of an automorphism group. We also introduce a new method of verifying Wilf’s conjecture via a combinatorially flavored game played on the elements of a certain finite poset.

Antichain Toggling and Rowmotion

In this paper, we analyze the toggle group on the set of antichains of a poset. Toggle groups, generated by simple involutions, were first introduced by Cameron and Fon-Der-Flaass for order ideals of posets. Recently Striker has motivated the study of toggle groups on general families of subsets, including antichains. This paper expands on this work by examining the relationship between the toggle groups of antichains and order ideals, constructing an explicit isomorphism between the two groups (for a finite poset). We also focus on the rowmotion action on antichains of a poset that has been well-studied in dynamical algebraic combinatorics, describing it as the composition of antichain toggles. We also describe a piecewise-linear analogue of toggling to the Stanley’s chain polytope. We examine the connections with the piecewise-linear toggling Einstein and Propp introduced for order polytopes and prove that almost all of our results for antichain toggles extend to the piecewise-linear setting.