Related papers: Unifom chains of small transfinite rank
We describe an error in the proof of a key proposition, which was necessary for the proof of the main result. Alternate proofs of the main result are given by Ozsvath-Stipsicz-Szabo and Dai-Hom-Stoffregen-Truong.
In the combinatorics of finite finite Coxeter groups, there is a simple formula giving the number of maximal chains of noncrossing partitions. It is a reinterpretation of a result by Deligne which is due to Chapoton, and the goal of this…
We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an example special case, we prove Benjamini-Schramm convergence for the uniform random unlabelled tree. We introduce a…
Let alpha = (a,b,...) be a composition. Consider the associated poset F(alpha), called a fence, whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... . We study the associated distributive…
We consider the problem of finding the smallest rank of a complex matrix whose absolute values of the entries are given. We call this minimum the phaseless rank of the matrix of the entrywise absolute values. In this paper we study this…
In this short note we confirm the deep structural correspondence between the complexity of a countable scattered chain (= strict linear order) and its big Ramsey combinatorics: we show that a countable scattered chain has finite big Ramsey…
When n is odd, consider the finite general linear and unitary groups of rank n, extended by the inverse transpose automorphism. There are elements in the extended groups which square to a regular unipotent element, and we evaluate the…
We give a characterizations of Ramsey ultrafilters on $\mathscr P(\omega)$ in terms of functions $f:\omega^n\to\omega$ and their ultrafilter extensions. To do this, we prove that for any partition $\mathcal P$ of $[\omega]^n$ there is a…
We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild…
We define the rank of elements of general unital rings, discuss its properties and give several examples to support the definition. In semiprime rings we give a characterization of rank in terms of invertible elements. As an application we…
A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…
In this paper, we study the symmetric rank of products of linear forms and an irreducible quadratic form. The main result presents a new, non-trivial lower bound for the rank, and the arguments rely on the apolarity lemma. In the special…
Motivated by applications to information retrieval, we study the lattice of antichains of finite intervals of a locally finite, totally ordered set. Intervals are ordered by reverse inclusion; the order between antichains is induced by the…
To explore the relation between properties of Loewner chains and properties of their driving functions, we study Loewner chains driven by functions $U$ of finite total variation. Under some appropriate conditions, we show existence of the…
This paper is a continuation of the work by the same authors on the Cartan group equipped with the sub-Finsler $\ell_\infty$ norm. We start by giving a detailed presentation of the structure of bang-bang extremal trajectories. Then we prove…
In this paper we study finite semiprimitive permutation groups, that is, groups in which each normal subgroup is transitive or semiregular. We give bounds on the order, base size, minimal degree, fixity, and chief length of an arbitrary…
This work investigates the rank properties of $A^+(B_n)$, the multiplicative semigroup reduct of the affine near-semirings over an aperiodic Brandt semigroup $B_n$. In this connection, the work obtains the small rank, lower rank and large…
A criterion is established for the transitivity of connectedness in a transfinite graph. Its proof is much shorter than a prior argument published previously for that criterion.
We consider the lattice of all the weak factorization systems on a given finite lattice. We prove that it is semidistributive, trim and congruence uniform. We deduce a graph theoretical approach to the problem of enumerating transfer…
We say that a class of finite structures for a finite first-order signature is $r$-compressible if each structure $G$ in the class has a first-order description of size at most $O(r(|G|))$. We show that the class of finite simple groups is…