English
Related papers

Related papers: Homotheties and incidences

200 papers

We say that an ideal I is homogeneous, if its restriction to any I-positive subset is isomorphic to I. The paper investigates basic properties of this notion -- we give examples of homogeneous ideals and present some applications to…

Logic · Mathematics 2017-09-26 Adam Kwela , Jacek Tryba

Cylindrically symmetric static manifolds are classified according to their homotheties and metrics. In each case the homothety vector fields and the corresponding metrics are obtained explicitly by solving the homothety equations. It turns…

General Relativity and Quantum Cosmology · Physics 2009-11-13 Asghar Qadir , M. Sharif , M. Ziad

In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…

Combinatorics · Mathematics 2019-03-19 Jeffrey Beyerl , Cameron Sharpe

Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in $\mathbb R^4$, such that the points of $P$ lie on an algebraic three-dimensional surface of degree $D$ that does not contain hyperplane or quadric components, and no 2-flat…

Combinatorics · Mathematics 2016-09-29 Micha Sharir , Noam Solomon

We reveal a complete set of constraints that need to be imposed on a set of 3-by-3 matrices to ensure that the matrices represent genuine homographies associated with multiple planes between two views. We also show how to exploit the…

Computer Vision and Pattern Recognition · Computer Science 2019-05-30 Wojciech Chojnacki , Zygmunt L. Szpak

Planar coincidence site lattices and modules with N-fold symmetry are well understood in a formulation based on cyclotomic fields, in particular for the class number one case, where they appear as certain principal ideals in the…

Metric Geometry · Mathematics 2007-05-23 Michael Baake , Uwe Grimm

Given a collection of planar graphs $G_1,\dots,G_k$ on the same set $V$ of $n$ vertices, the simultaneous geometric embedding (with mapping) problem, or simply $k$-SGE, is to find a set $P$ of $n$ points in the plane and a bijection $\phi:…

Computational Geometry · Computer Science 2015-05-08 Jean Cardinal , Vincent Kusters

We first review some topics in the classical computational geometry of lines, in particular the O(n^{3+\epsilon}) bounds for the combinatorial complexity of the set of lines in R^3 interacting with $n$ objects of fixed description…

Metric Geometry · Mathematics 2007-05-23 Frank Sottile , Thorsten Theobald

In a containment problem, the goal is to preprocess a set of geometric objects so that, given a geometric query object, we can report all the objects containing the query object. We consider the containment problem where input objects are…

Data Structures and Algorithms · Computer Science 2024-11-28 Waseem Akram , Sanjeev Saxena

This is the second in a series of papers. Here we develop here an intersection theory for manifolds equipped with an action of a finite group. As in our previous paper, our approach will be homotopy theoretic, enabling us to circumvent the…

Algebraic Topology · Mathematics 2009-01-23 John R. Klein , Bruce Williams

In recent work by Johnson et al. (2022), a framework was described for the study of graph problems over classes specified by omitting each of a finite set of graphs as subgraphs. If a problem falls into the framework then its computational…

Computational Complexity · Computer Science 2025-03-17 Tala Eagling-Vose , Barnaby Martin , Daniel Paulusma , Siani Smith

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Combinatorics · Mathematics 2016-11-22 Bernardo Abrego , Silvia Fernandez-Merchant , Daniel J. Katz , Levon Kolesnikov

Hypersurfaces are studied and classified under multiple additional assumptions in any Riemannian homogeneous space $(\mathbb{C}P^3, g_a)$, including nearly K\"ahler $\mathbb{C}P^3$. Notably, all extrinsically homogeneous hypersurfaces are…

Differential Geometry · Mathematics 2025-03-13 Michaël Liefsoens

Given a set of points $P$ and a set of regions $\mathcal{O}$, an incidence is a pair $(p,o ) \in P \times \mathcal{O}$ such that $p \in o$. We obtain a number of new results on a classical question in combinatorial geometry: What is the…

Computational Geometry · Computer Science 2023-02-27 Timothy M. Chan , Sariel Har-Peled

This article is the first part of a two-fold study, the objective of which is the theoretical analysis and numerical investigation of new approximate corrector problems in the context of stochastic homogenization. We present here three new…

Numerical Analysis · Mathematics 2018-07-16 Eric Cancès , Virginie Ehrlacher , Frederic Legoll , Benjamin Stamm , Shuyang Xiang

We study the existence and the schematic structure of elementary components of the nested Hilbert scheme on a smooth quasi-projective variety. Precisely, we find a new lower bound for the existence of non-smoothable nestings of fat points…

Algebraic Geometry · Mathematics 2026-01-26 Michele Graffeo , Paolo Lella

The Surjective Homomorphism problem is to test whether a given graph G called the guest graph allows a vertex-surjective homomorphism to some other given graph H called the host graph. The bijective and injective homomorphism problems can…

Discrete Mathematics · Computer Science 2016-12-16 Petr A. Golovach , Bernard Lidický , Barnaby Martin , Daniël Paulusma

Let X, Y, and Z be topological modules over a topological ring $R$. In the first part of the paper, we introduce three different classes of bounded bigroup homomorphisms from $X\times Y$ into $Z$ with respect to the three different uniform…

Functional Analysis · Mathematics 2017-10-24 Omid Zabeti

Suppose we are given a finite set of points $P$ in $\R^3$ and a collection of polytopes $\mathcal{T}$ that are all translates of the same polytope $T$. We consider two problems in this paper. The first is the set cover problem where we want…

Computational Geometry · Computer Science 2008-02-21 Sören Laue

A venerable problem in combinatorics and geometry asks whether a given incidence relation may be realized by a configuration of points and lines. The classic version of this would ask for algebraic lines over some field or possibly real…

Geometric Topology · Mathematics 2016-06-07 Daniel Ruberman , Laura Starkston
‹ Prev 1 3 4 5 6 7 10 Next ›