English
Related papers

Related papers: Normal art galleries: wall in - all in

200 papers

We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…

Combinatorics · Mathematics 2017-05-12 Christian Bean , Bjarki Gudmundsson , Henning Ulfarsson

In this paper we establish a new characterisation of star-regular categories, using a property of internal reflexive graphs, which is suggested by a recent result due to O. Ngaha Ngaha and the first author. We show that this property is, in…

Category Theory · Mathematics 2014-04-24 Marino Gran , Zurab Janelidze

We consider a generalized angle in complex normed vector spaces. Its definition corresponds to the definition of the well known Euclidean angle in real inner product spaces. Not surprisingly it yields complex values as `angles'. This…

Functional Analysis · Mathematics 2015-06-17 Volker W. Thürey

Art Gallery Localization (AGL) is the problem of placing a set $T$ of broadcast towers in a simple polygon $P$ in order for a point to locate itself in the interior. For any point $p \in P$: for each tower $t \in T \cap V(p)$ (where $V(p)$…

Computational Geometry · Computer Science 2018-11-30 Prosenjit Bose , Jean-Lou De Carufel , Alina Shaikhet , Michiel Smid

The concept of transparent and opaque horizons is defined. One example of opaqueness is the presence of a firewall. Two apparently contradictory statements are reconciled: The overwhelming number of black hole states have opaque horizons;…

High Energy Physics - Theory · Physics 2016-12-21 Leonard Susskind

We define, via Gorenstein homomorphisms, a class of local rings over which there exist non-trivial totally reflexive modules. We also provide a general construction of such rings, which indicates their abundance.

Commutative Algebra · Mathematics 2011-05-25 Kristen A. Beck

We address recently proposed chromatic versions of the classic Art Gallery Problem. Assume a simple polygon $P$ is guarded by a finite set of point guards and each guard is assigned one of $t$ colors. Such a chromatic guarding is said to be…

Computational Geometry · Computer Science 2014-12-15 Frank Hoffmann , Klaus Kriegel , Max Willert

We interpret a normal surface in a (singular) three-manifold in terms of the homology of a chain complex. This allows us to study the relation between normal surfaces and their quadrilateral co-ordinates. Specifically, we give a proof of an…

Geometric Topology · Mathematics 2008-10-03 Siddhartha Gadgil , Tejas Kalelkar

The aim of this paper is two-fold. First, the study of $C_{12}$-structure (called by us corner structure) is extended to the general case without any condition, unlike our previous papers (see, \cite{BB, BG2, BG, BBB}). Second, starting…

Differential Geometry · Mathematics 2023-07-31 Beldjilali Gherici

The chosen tool of this thesis is an extremal type approach. The lesson drawn by the theorems proved in the thesis is that surprisingly small compromise is necessary on the efficacy of the solutions to make the approach work. The problems…

Combinatorics · Mathematics 2017-11-09 Tamás Róbert Mezei

We propose precise notions of what it means to guard a domain "robustly", under a variety of models. While approximation algorithms for minimizing the number of (precise) point guards in a polygon is a notoriously challenging area of…

Computational Geometry · Computer Science 2024-03-19 Rathish Das , Omrit Filtser , Matthew J. Katz , Joseph S. B. Mitchell

In this paper we introduce a notion of {\it generalized operad} containing as special cases various kinds of operad--like objects: ordinary, cyclic, modular, properads etc. We then construct inner cohomomorphism objects in their categories…

Category Theory · Mathematics 2011-01-10 D. Borisov , Yu. I. Manin

In this paper, we give a new axioms system based on nonseparable flats with their ranks to define a matroid. We deduce a polynomial time algorithm for deciding if a given matroid (respectively, arbitrary structure) is an uniform matroid.…

Combinatorics · Mathematics 2024-02-15 Brahim Chaourar

In a simple drawing of a graph, any two edges intersect in at most one point (either a common endpoint or a proper crossing). A simple drawing is generalized twisted if it fulfills certain rather specific constraints on how the edges are…

Computational Geometry · Computer Science 2025-08-25 Oswin Aichholzer , Alfredo García , Javier Tejel , Birgit Vogtenhuber , Alexandra Weinberger

A partial complement of the graph $G$ is a graph obtained from $G$ by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph $G$ and graph class $\mathcal{G}$, is there a…

Computational Complexity · Computer Science 2020-06-11 Fedor V. Fomin , Petr A. Golovach , Torstein J. F. Strømme , Dimitrios M. Thilikos

In this paper, we introduce techniques for producing normal square-free monomial ideals from old such ideals. These techniques are then used to investigate the normality of cover ideals under some graph operations. Square-free monomial…

The artistic style of a painting is a subtle aesthetic judgment used by art historians for grouping and classifying artwork. The recently introduced `neural-style' algorithm substantially succeeds in merging the perceived artistic style of…

Computer Vision and Pattern Recognition · Computer Science 2019-06-04 Jeremiah Johnson

We define a 2-normal surface to be one which intersects every 3-simplex of a triangulated 3-manifold in normal triangles and quadrilaterals, with one or two exceptions. The possible exceptions are a pair of octagons, a pair of unknotted…

Geometric Topology · Mathematics 2009-09-29 David Bachman

Each simplicial complex and integer vector yields a vector configuration whose combinatorial properties are important for the analysis of contingency tables. We study the normality of these vector configurations including a description of…

Combinatorics · Mathematics 2016-01-08 Daniel Irving Bernstein , Seth Sullivant

We show that a rational normal scroll can in general be set-theoretically defined by a proper subset of the 2-minors of the associated two-row matrix. This allows us to find a class of rational normal scrolls that are almost set-theoretic…

Algebraic Geometry · Mathematics 2007-05-23 Margherita Barile
‹ Prev 1 4 5 6 7 8 10 Next ›