English
Related papers

Related papers: Finite determinacy and stability of flatness of an…

200 papers

A perfect matching in a hypergraph is a set of edges that partition the set of vertices. We study the complexity of deciding the existence of a perfect matching in orderable and separable hypergraphs. We show that the class of orderable…

Combinatorics · Mathematics 2022-02-03 Shmuel Onn

In this paper we introduce flat grafting as a deformation of quadratic differentials on a surface of finite type that is analogous to the grafting map on hyperbolic surfaces. Flat grafting maps are generic in the strata structure and…

Geometric Topology · Mathematics 2018-03-28 Ser-Wei Fu

We construct a finitely dimensional invariant manifold of holomorphic discs attached to a certain class of smooth pseudconvex hypersurfaces of finite type in $\C^2$, generalizing the notion of stationary discs. The discs we construct are…

Complex Variables · Mathematics 2013-08-01 Florian Bertrand , Giuseppe Della Sala

We obtain sharp estimates on the connectivity of complex affine hypersurfaces in terms of the decomposition of the defining equation as a sum of weighted homogeneous components relative to some weight system.

Algebraic Geometry · Mathematics 2007-05-23 A. Dimca , L. Paunescu

We exhibit a polynomial time computable plane curve GAMMA that has finite length, does not intersect itself, and is smooth except at one endpoint, but has the following property. For every computable parametrization f of GAMMA and every…

Computational Complexity · Computer Science 2009-05-19 Xiaoyang Gu , Jack H. Lutz , Elvira Mayordomo

We determine the structure of the finite groups with the property that every cyclic subgroup is the intersection of maximal subgroups, comparing this property with the one where all proper subgroups are intersections of maximal subgroups.

Group Theory · Mathematics 2025-08-07 Andrea Lucchini

An algebraic proof is presented for the finite strong standard completeness of involutive uninorm logic with fixed point. The result may provide a first step towards settling the open standard completeness problem for involutive uninorm…

Logic · Mathematics 2019-10-04 Sándor Jenei

Generalized (rational) graph contractions in the framework of a dislocated metric space endowed with a directed graph are investigated. Fixed point results for set-contractions are obtained. We also provide some examples to illustrate our…

Combinatorics · Mathematics 2023-08-09 Talat Nazir , Zakaria Ali , Shahin Nosrat Jogan , Sergei Silvestrov

For mappings in metric spaces satisfying one inequality with respect to modulus of families of curves, there is proved a lightness of the uniform limit of these mappings. It is proved that, the uniform limit of these mappings is light…

Metric Geometry · Mathematics 2018-01-31 E. A. Sevost'yanov , S. A. Skvortsov

This paper treats the problem of the merging of formations, where the underlying model of a formation is graphical. We first analyze the rigidity and persistence of meta-formations, which are formations obtained by connecting several rigid…

Multiagent Systems · Computer Science 2007-10-16 Julien M. Hendrickx , Changbin Yu , Baris Fidan , Brian D. O. Anderson

We prove under certain conditions that any stable unfolding of a quasi-homogeneous map-germ with finite singularity type is substantial. We then prove that if an equidimensional map-germ is finitely determined, of corank 1, and either it…

Algebraic Geometry · Mathematics 2025-04-09 Ignacio Breva Ribes , Raúl Oset Sinha

We study scaling function geometry. We show the existence of the scaling function of a geometrically finite one-dimensional mapping. This scaling function is discontinuous. We prove that the scaling function and the asymmetries at the…

Dynamical Systems · Mathematics 2008-02-03 Yunping Jiang

Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…

Computational Geometry · Computer Science 2023-08-22 Oswin Aichholzer , Birgit Vogtenhuber , Alexandra Weinberger

We give an upper bound on the number of perfect matchings in an undirected simple graph $G$ with an even number of vertices, in terms of the degrees of all the vertices in $G$. This bound is sharp if $G$ is a union of complete bipartite…

Combinatorics · Mathematics 2008-03-07 Shmuel Friedland

For each closed surface of genus $g\ge3$, we find a finite subcomplex of the separating curve complex that is rigid with respect to incidence-preserving maps.

Geometric Topology · Mathematics 2021-09-16 Junzhi Huang , Bena Tshishiku

We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point…

Optimization and Control · Mathematics 2020-03-26 D. Russell Luke , Marc Teboulle , Nguyen H. Thao

On one hand, we study the class of graphs on surfaces, satisfying tessellation properties, with positive Forman curvature on each edge. Via medial graphs, we provide a new proof for the finiteness of the class, and give a complete…

Combinatorics · Mathematics 2020-02-11 Yohji Akama , Bobo Hua , Yanhui Su , Haohang Zhang

Let $R$ be a commutative ring. Roughly speaking, we prove that an $R$-module $M$ is flat iff it is a direct limit of $R$-module affine algebraic varieties, and $M$ is a flat Mittag-Leffler module iff it is the union of its $R$-submodule…

Algebraic Geometry · Mathematics 2017-10-12 Carlos Sancho , Fernando Sancho , Pedro Sancho

It is shown that a fixed point of a completely positive map on a semi-finite von Neumann algebra must commute with the operators determining the map (the Lueders phenomenon) if the element is finite or has finite square.

Operator Algebras · Mathematics 2007-05-23 Gert K. Pedersen

Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…

Computational Geometry · Computer Science 2024-07-08 Linda Kleist , Peter Kramer , Christian Rieck
‹ Prev 1 3 4 5 6 7 10 Next ›