Related papers: Cutting Corners
Let $X$ be a set and let $S$ be an inverse semigroup of partial bijections of $X$. Thus, an element of $S$ is a bijection between two subsets of $X$, and the set $S$ is required to be closed under the operations of taking inverses and…
We classify all total orders having a certain convex property on the positive root system of an arbitrary untwisted affine Lie algebra ${\frak g}$. Such total orders are called convex orders and are used to construct convex bases of…
We provide a systematic method to deduce the global form of flavor symmetry groups in 4d N=2 theories obtained by compactifying 6d N=(2,0) superconformal field theories (SCFTs) on a Riemann surface carrying regular punctures and possibly…
The intersection cut paradigm is a powerful framework that facilitates the generation of valid linear inequalities, or cutting planes, for a potentially complex set S. The key ingredients in this construction are a simplicial conic…
In this work, we propose a new segmentation algorithm for images containing convex objects present in multiple shapes with a high degree of overlap. The proposed algorithm is carried out in two steps, first we identify the visible contours,…
Segmenting an image into multiple components is a central task in computer vision. In many practical scenarios, prior knowledge about plausible components is available. Incorporating such prior knowledge into models and algorithms for image…
It is shown that a group defined by forbidding all patterns of size s+1 that do not appear in a given self-similar group of tree automorphisms is the topological closure of a self-similar, countable, regular branch group, branching over its…
We characterize the global symmetries for the conjecturally complete collection of six dimensional superconformal field theories (6D SCFTs) which are realizable in F-theory and have no frozen singularities. We provide comprehensive checks…
The effectiveness of Symmetric Positive Definite (SPD) manifold features has been proven in various computer vision tasks. However, due to the non-Euclidean geometry of these features, existing Euclidean machineries cannot be directly used.…
We define standardized constructions of finite fields, and standardized generators of (multiplicative) cyclic subgroups in these fields. The motivation is to provide a substitute for Conway polynomials which can be used by various software…
In this article we study convexity properties of distance functions in infinite dimensional Finsler unitary groups, such as the full unitary group, the unitary Schatten perturbations of the identity and unitary groups of finite von Neumann…
We will explore the nature of when certain finite groups have an equal covering, and when finite groups do not. Not to be confused with the concept of a cover group, a covering of a group is a collection of proper subgroups whose…
Decomposition of shapes into (approximate) convex parts is essential for applications such as part-based shape representation, shape matching, and collision detection. In this paper, we propose a novel convex decomposition using a…
We use differential forms on loop spaces to prove that the fundamental group of certain geometric transformation groups is infinite. Examples include both finite and infinite dimensional Lie groups. The finite dimensional examples are the…
In many applications it is important to establish if a given topological preordered space has a topology and a preorder which can be recovered from the set of continuous isotone functions. Under antisymmetry this property, also known as…
Beyond the crucial role they play in the foundations of the theory of overconvergent modular forms, canonical subgroups have found new applications to analytic continuation of overconvergent modular forms. For such applications, it is…
Universality of quantum mechanics -- its applicability to physical systems of quite different nature and scales -- indicates that quantum behavior can be a manifestation of general mathematical properties of systems containing…
Let $\Gamma(G)$ be the Gruenberg-Kegel graph of a finite group $G$. We prove that if $G$ is solvable and $\sigma$ is a cut-set for $\Gamma(G)$, then $G$ has a $\sigma$-series of length $5$ whose factors are controlled. As a consequence, we…
Working in the soft-element (classical) viewpoint, we introduce \emph{soft bitopological groups}: soft groups endowed with two soft topologies such that the induced topologies on the set of soft elements make the soft-element group into a…
We establish a regular sampling theory in the range of the analysis operator of a continuous frame having a unitary structure. The unitary structure is related with a unitary representation of a locally compact abelian group on a separable…