Related papers: Flips in symmetric separated set-systems

Plabic graphs are interesting combinatorial objects used to study the totally nonnegative Grassmannian. Faces of plabic graphs are labeled by $k$-element sets of positive integers, and a collection of such $k$-element sets are the face…

Symmetric rings were introduced by Lambek to extend usual commutative ideal theory in noncommutative rings. In this paper, we study symmetric rings over which Ore extensions are symmetric. A ring R is called strongly \sigma-symmetric if the…

In this article we consider the cycle structure of compositions of pairs of involutions in the symmetric group S_n chosen uniformly at random. These can be modeled as modified 2-regular graphs, giving rise to exponential generating…

Let $\mathcal{D}$ be a Hom-finite, Krull-Schmidt, 2-Calabi-Yau triangulated category with a rigid object $R$. Let $\Lambda=\operatorname{End}_{\mathcal{D}}R$ be the endomorphism algebra of $R$. We introduce the notion of mutation of maximal…

This article belongs to a series on geometric complexity theory (GCT), an approach to the P vs. NP and related problems through algebraic geometry and representation theory. The basic principle behind this approach is called the flip. In…

We show that there is an hierarchy of intersection rigidity properties of sets in a closed symplectic manifold: some sets cannot be displaced by symplectomorphisms from more sets than the others. We also find new examples of rigidity of…

We consider matching with shifts for Gibbsian sequences. We prove that the maximal overlap behaves as $c\log n$, where $c$ is explicitly identified in terms of the thermodynamic quantities (pressure) of the underlying potential. Our…

Consider a permutation p to be any finite list of distinct positive integers. A statistic is a function St whose domain is all permutations. Let S(p,q) be the set of shuffles of two disjoint permutations p and q. We say that St is shuffle…

In this paper we introduce filtration pairs for isolated invariant sets of continuous maps. We prove the existence of filtration pairs and show that, up to shift equivalence, the induced map on the corresponding pointed space is an…

An open question akin to the slice-ribbon conjecture asks whether every ribbon knot can be represented as a symmetric union. Next to this basic existence question sits the question of uniqueness of such representations. Eisermann and Lamm…

In a region $R$ consisting of unit squares, a domino is the union of two adjacent squares and a (domino) tiling is a collection of dominoes with disjoint interior whose union is the region. The flip graph $\mathcal{T}(R)$ is defined on the…

A totally symmetric set is a subset of a group such that every permutation of the subset can be realized by conjugation in the group. The (non-)existence of large totally symmetric sets obstruct homomorphisms, so bounds on the sizes of…

We perform a comprehensive study of a certain class of discrete symmetries of families of Feynman integrals, defined as affine changes of variables that map different sectors of the family into each other. We show that these transformations…

Let $S_n$ be the symmetric group on the set $[n]:=\{1,2,\ldots,n\}$. Given a permutation $\sigma=\sigma_1\sigma_2 \cdots \sigma_n \in S_n$, we say it has a descent at index $i$ if $\sigma_i>\sigma_{i+1}$. Let $\mathcal{D}(\sigma)$ be the…

Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…

We provide another approach to Friedland's result that the topological entropy $h$ of a symmetric nearest-neighbor subshift is computable. Instead of the previous algebraic technique, our approach is mostly combinatorial and involves only…

Given a finite $n$-element set $X$, a family of subsets ${\mathcal F}\subset 2^X$ is said to separate $X$ if any two elements of $X$ are separated by at least one member of $\mathcal F$. It is shown that if $|\mathcal F|>2^{n-1}$, then one…

Given a set $V$, a subset $S$, and a permutation $\pi$ of $V$, we say that $\pi$ permutes $S$ if $\pi (S) \cap S = \emptyset$. Given a collection $\cS = \{V; S_1,\ldots , S_m\}$, where $S_i \subseteq V ~~(i=1,\ldots ,m)$, we say that $\cS$…

A symmetric subset of the reals is one that remains invariant under some reflection x --> c-x. Given 0 < x < 1, there exists a real number D(x) with the following property: if 0 < d < D(x), then every subset of [0,1] with measure x contains…

A skew morphism of a finite group $B$ is a permutation of $B$ fixing the identity and satisfying $\varphi(xy) = \varphi(x)\varphi^{i_x}(y)$ for some integers $i_x$ indexed by $x \in B$. The enumeration of skew morphisms of finite cyclic…