English
Related papers

Related papers: Flips in symmetric separated set-systems

200 papers

We introduce and analyze a Spencer-type elliptic complex on the space of differential forms valued in symmetric powers of an adjoint bundle, $\Omega^\bullet(X)\otimes \mathrm{Sym}^\bullet(G)$. The complex is governed by a total differential…

General Mathematics · Mathematics 2025-09-30 Dongzhe Zheng

We study the non-invertible symmetries of class $\mathcal{S}$ theories obtained by compactifying the type $\mathfrak{a}_{p-1}$ 6d (2,0) theory on a genus $g$ Riemann surface with no punctures. After setting up the general framework, we…

High Energy Physics - Theory · Physics 2023-06-14 Vladimir Bashmakov , Michele Del Zotto , Azeem Hasan , Justin Kaidi

Centrosymmetric involutions in the symmetric group S_{2n} are permutations \pi such that \pi=\pi^{-1} and \pi(i)+\pi(2n+1-i)=2n+1 for all i, and they are in bijection with involutions of the hyperoctahedral group. We describe the…

Combinatorics · Mathematics 2015-09-01 Marilena Barnabei , Flavio Bonetti , Sergi Elizalde , Matteo Silimbani

This paper mainly studies nonnegativity decision of forms based on variable substitutions. Unlike existing research, the paper regards simplex subdivisions as new perspectives to study variable substitutions, gives some subdivisions of the…

Symbolic Computation · Computer Science 2009-12-23 Xiaorong Hou , Song Xu

Simultaneous diagonal flips in plane triangulations are investigated. It is proved that every $n$-vertex triangulation with at least six vertices has a simultaneous flip into a 4-connected triangulation, and that it can be computed in O(n)…

Combinatorics · Mathematics 2008-09-09 Prosenjit Bose , Jurek Czyzowicz , Zhicheng Gao , Pat Morin , David R. Wood

An element $g$ of a group is called reversible if it is conjugate in the group to its inverse. An element is an involution if it is equal to its inverse. This paper is about factoring elements as products of reversibles in the group…

Group Theory · Mathematics 2014-02-11 Dmitri Zaitsev , Anthony G. O'Farrell

We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…

Dynamical Systems · Mathematics 2015-09-02 Volker Mayer , Mariusz Urbanski

The Boolean lattice $2^{[n]}$ is the power set of $[n]$ ordered by inclusion. A chain $c_{0}\subset...\subset c_{k}$ in $2^{[n]}$ is rank-symmetric, if $|c_{i}|+|c_{k-i}|=n$ for $i=0,...,k$; and it is symmetric, if $|c_{i}|=(n-k)/2+i$. We…

Combinatorics · Mathematics 2015-09-25 Istvan Tomon

Given a feature set for the shape of a closed loop, it is natural to ask which features in that set do not change when the starting point of the path is moved. For example, in two dimensions, the area enclosed by the path does not depend on…

Rings and Algebras · Mathematics 2024-12-30 Joscha Diehl , Rosa Preiß , Jeremy Reizenstein

Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…

Combinatorics · Mathematics 2021-01-05 Arvind Ayyer , Daniel Hathcock , Prasad Tetali

Superconformal symmetry in six-dimensions is analyzed in terms of coordinate transformations on superspace. A superconformal Killing equation is derived and its solutions are identified in terms of supertranslations, dilations, Lorentz…

High Energy Physics - Theory · Physics 2016-09-06 Jeong-Hyuck Park

A flipturn is an operation that transforms a nonconvex simple polygon into another simple polygon, by rotating a concavity 180 degrees around the midpoint of its bounding convex hull edge. Joss and Shannon proved in 1973 that a sequence of…

An involution in a Coxeter group has an associated set of involution words, a variation on reduced words. These words are saturated chains in a partial order first considered by Richardson and Springer in their study of symmetric varieties.…

Combinatorics · Mathematics 2019-06-27 Eric Marberg , Brendan Pawlowski

In this article we introduced algebraic sieves, i.e. selection procedures on a given finite set to extract a particular subset. Such procedures are performed by finite groups acting on the set. They are called sieves because there are…

Group Theory · Mathematics 2025-02-25 Francesco Maltese

We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…

Metric Geometry · Mathematics 2025-12-23 Paolo Bonicatto , Panu Lahti , Enrico Pasqualetto

If F is a type-definable family of commensurable subsets, subgroups or sub-vector spaces in a metric structure, then there is an invariant subset, subgroup or sub-vector space commensurable with F. This in particular applies to…

Logic · Mathematics 2020-04-10 Itaï Ben Yaacov , Frank Olaf Wagner

An interval in a combinatorial structure S is a set I of points which relate to every point from S I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a…

Combinatorics · Mathematics 2014-01-14 Robert Brignall , Nik Ruskuc , Vince Vatter

$A$ set is called $IP$-set in a semigroup $\left(S,\cdot \right)$ if it contains finite products of a sequence. A set that intersects with all $IP$-sets is called $IP^\star$-set. It is a well known and established result by Bergelson and…

Combinatorics · Mathematics 2024-05-22 Pintu Debnath

Two related questions are discussed. The first is when reflection symmetry in a finite set of $i$-dimensional subspaces, $i\in \{1,\dots,n-1\}$, implies full rotational symmetry, i.e., the closure of the group generated by the reflections…

Metric Geometry · Mathematics 2022-05-06 Gabriele Bianchi , Richard J. Gardner , Paolo Gronchi

Given a finite set $V$, a convexity $\mathscr{C}$, is a collection of subsets of $V$ that contains both the empty set and the set $V$ and is closed under intersections. The elements of $\mathscr{C}$ are called convex sets. The digital…

Combinatorics · Mathematics 2020-08-07 MacKenzie Carr , Christina M. Mynhardt , Ortrud R. Oellermann