English
Related papers

Related papers: Arrangements of Approaching Pseudo-Lines

200 papers

We seek discrete approximations to solutions $u:\Omega \to R$ of semilinear elliptic partial differential equations of the form $\Delta u + f_s(u) = 0$, where $f_s$ is a one-parameter family of nonlinear functions and $\Omega$ is a domain…

Pattern Formation and Solitons · Physics 2013-01-31 John M. Neuberger , Nandor Sieben , James W. Swift

A graph is pseudo-outerplanar if each of its blocks has an embedding in the plane so that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. It is proved that…

Combinatorics · Mathematics 2013-04-24 Xin Zhang

We study smooth rational closed embeddings of the real affine line into the real affine plane, that is algebraic rational maps from the real affine line to the real affine plane which induce smooth closed embeddings of the real euclidean…

Algebraic Geometry · Mathematics 2025-05-26 Adrien Dubouloz , Frédéric Mangolte

We characterize general pseudo-harmonic morphisms from a Riemannian manifold to a Hermitian manifold as pseudo horizontally weakly conformal maps with an additional property. We study to what extent we can (locally) describe these…

Differential Geometry · Mathematics 2007-12-18 Radu Slobodeanu

We introduce a class of potential submanifolds in pseudo-Euclidean spaces (each N-dimensional potential submanifold is a special flat torsionless submanifold in a 2N-dimensional pseudo-Euclidean space) and prove that each N-dimensional…

Differential Geometry · Mathematics 2010-01-04 O. I. Mokhov

${\cal U}$ntil now the representation (i.e. plotting) of curve in Parallel Coordinates is constructed from the point $\leftrightarrow$ line duality. The result is a ``line-curve'' which is seen as the envelope of it's tangents. Usually this…

Other Computer Science · Computer Science 2007-05-23 Zur Izhakian

Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules…

Numerical Analysis · Mathematics 2014-11-14 Costanza Conti , Luca Gemignani , Lucia Romani

Linear topological spaces with partial ordering (linear kinematics) are studied. They are defined by a set of 8 axioms implying that topology, linear structure and ordering are compatible with each other. Most of the results are valid for…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Victor Revoltovich Krym

A notion of dual curve for pseudoholomorphic curves in 4--manifolds turns out to be possible only if the notion of almost complex structure structure is slightly generalized. The resulting structure is as easy (perhaps easier) to work with,…

Differential Geometry · Mathematics 2007-05-23 Benjamin McKay

This paper introduces even triangulations of n-dimensional pseudo-manifolds and links their combinatorics to the topology of the pseudo-manifolds. This is done via normal hypersurface theory and the study of certain symmetric…

Geometric Topology · Mathematics 2015-11-25 J. Hyam Rubinstein , Stephan Tillmann

We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that can be represented as intersection graph of subpaths on a tree…

Combinatorics · Mathematics 2008-09-12 Cornelia Dangelmayr , Stefan Felsner , William T. Trotter

We establish that every second countable completely regularly preordered space (E,T,\leq) is quasi-pseudo-metrizable, in the sense that there is a quasi-pseudo-metric p on E for which the pseudo-metric p\veep^-1 induces T and the graph of…

General Topology · Mathematics 2012-11-21 E. Minguzzi

A drawing of a graph is {\em pseudolinear} if there is a pseudoline arrangement such that each pseudoline contains exactly one edge of the drawing. The {\em pseudolinear crossing number} of a graph $G$ is the minimum number of pairwise…

Combinatorics · Mathematics 2019-04-29 Cesar Hernandez-Velez , Jesus Leanos , Gelasio Salazar

This paper presents the first purely numerical (i.e., non-algebraic) subdivision algorithm for the isotopic approximation of a simple arrangement of curves. The arrangement is "simple" in the sense that any three curves have no common…

Computational Geometry · Computer Science 2020-09-03 Jyh-Ming Lien , Vikram Sharma , Gert Vegter , Chee Yap

We prove that steady state bifurcations in finite-dimensional dynamical systems that are symmetric with respect to a monoid representation generically occur along an absolutely indecomposable subrepresentation. This is stated as a…

Dynamical Systems · Mathematics 2018-10-10 Sören Schwenker

Isomorphs are curves in the thermodynamic phase diagram of invariant excess entropy, structure, and dynamics, while pseudoisomorphs are curves of invariant structure and dynamics, but not of the excess entropy. The latter curves have been…

Soft Condensed Matter · Physics 2024-10-30 Zahraa Sheydaafar , Jeppe C. Dyre , Thomas B. Schrøder

We introduce the concept of pseudo-trisections of smooth oriented compact 4-manifolds with boundary. The main feature of pseudo-trisections is that they have lower complexity than relative trisections for given 4-manifolds. We prove…

Geometric Topology · Mathematics 2025-02-19 Shintaro Fushida-Hardy

Pseudo-arcs are the higher dimensional analogues of arcs in a projective plane: a pseudo-arc is a set $\mathcal{A}$ of $(n-1)$-spaces in $\mathrm{PG}(3n-1,q)$ such that any three span the whole space. Pseudo-arcs of size $q^n+1$ are called…

Combinatorics · Mathematics 2014-08-01 Sara Rottey , Geertrui Van de Voorde

As a first step toward a fully two-dimensional asymptotic theory for the bifurcation of solitons from infinitesimal continuous waves, an analytical theory is presented for line solitons, whose envelope varies only along one direction, in…

Pattern Formation and Solitons · Physics 2013-05-03 Sean Nixon , T. R. Akylas , Jianke Yang

Let ${\cal L}$ be an arrangement of $n$ lines in the Euclidean plane. The \emph{$k$-level} of ${\cal L}$ consists of all vertices $v$ of the arrangement which have exactly $k$ lines of ${\cal L}$ passing below $v$. The complexity (the…

Computational Geometry · Computer Science 2020-03-10 Man-Kwun Chiu , Stefan Felsner , Manfred Scheucher , Patrick Schnider , Raphael Steiner , Pavel Valtr