English
Related papers

Related papers: On the recognition problem for virtually special c…

200 papers

We shall show how to decompose, by functorial and canonical fibrations, arbitrary $n$-dimensional complex projective {Although the geometric results apply to compact K\" ahler manifolds without change, we consider here for simplicity this…

Algebraic Geometry · Mathematics 2010-01-22 Frederic Campana

In this paper we describe an algorithm for the computation of canonical forms of finite subsets of $\mathbb{Z}^d$, up to affinities over $\mathbb{Z}$. For fixed dimension $d$, this algorithm has worst-case asymptotic complexity $O(n \log^2…

Data Structures and Algorithms · Computer Science 2018-09-28 Giovanni Paolini

Let S be a smooth algebraic surface satisfying the following property: H^i(\oc_S(C))=0 (i=1,2) for any irreducible and reduced curve C of S. The aim of this paper is to provide a characterization of special linear systems on S which are…

Algebraic Geometry · Mathematics 2007-05-23 Antonio Laface

Let X be a smooth variety over $F_p$. Let E be a number field. For each nonarchimedean place $\lambda$ of E prime to p consider the set of isomorphism classes of irreducible lisse $\bar{E}_{\lambda}$-sheaves on X with determinant of finite…

Number Theory · Mathematics 2018-03-02 Vladimir Drinfeld

The aim of this paper is to investigate an attempt to build a binary classification algorithm using principles of geometry such as vectors, planes, and vector algebra. The basic idea behind the proposed algorithm is that a hyperplane can be…

Machine Learning · Computer Science 2025-03-04 Vatsal Srivastava

We prove that curve complexes of surfaces are finitely rigid: for every orientable surface S of finite topological type, we identify a finite subcomplex X of the curve complex C(S) such that every locally injective simplicial map from X…

Geometric Topology · Mathematics 2012-07-25 Javier Aramayona , Christopher J. Leininger

Let M be a graph manifold. We prove that fundamental groups of embedded incompressible surfaces in M are separable in the fundamental group of M, and that the double cosets for crossing surfaces are also separable. We deduce that if there…

Geometric Topology · Mathematics 2014-01-17 Piotr Przytycki , Daniel T. Wise

We show that in random $K$-uniform hypergraphs of constant average degree, for even $K \geq 4$, local algorithms defined as factors of i.i.d. can not find nearly maximal cuts, when the average degree is sufficiently large. These algorithms…

Probability · Mathematics 2019-11-05 Wei-Kuo Chen , David Gamarnik , Dmitry Panchenko , Mustazee Rahman

In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…

Algebraic Geometry · Mathematics 2007-05-23 Laurent Buse , Marc Chardin

We show that for two afii varieties over an arbitrary field of characteristic zero, there is no general form of an algorithm for checking the presence of an embedding of one algebraic variety in another. Moreover, we establish this for…

Algebraic Geometry · Mathematics 2019-07-01 A. J. Kanel-Belov , A. A. Chilikov

Motivated by the physical concept of special geometry two mathematical constructions are studied, which relate real hypersurfaces to tube domains and complex Lagrangean cones respectively. Me\-thods are developed for the classification of…

Differential Geometry · Mathematics 2016-09-06 Vicente Cortés

Barker and Larman asked the following. Let $K' \subset {\Bbb{R}}^d$ be a convex body, whose interior contains a given convex body $K \subset {\Bbb{R}}^d$, and let, for all supporting hyperplanes $H$ of $K$, the $(d-1)$-volumes of the…

Metric Geometry · Mathematics 2016-02-03 E. Makai, , H. Martini

We prove two results about vector bundles on singular algebraic surfaces. First, on proper surfaces there are vector bundles of rank two with arbitrarily large second Chern number and fixed determinant. Second, on separated normal surfaces…

Algebraic Geometry · Mathematics 2007-05-23 Stefan Schroeer , Gabriele Vezzosi

Alon and F\"uredi (European J. Combin., 1993) proved that any family of hyperplanes that covers every point of the Boolean cube $\{0,1\}^n$ except one must contain at least $n$ hyperplanes. We obtain two extensions of this result, in…

Combinatorics · Mathematics 2023-01-03 S. Venkitesh

We investigate local distinguishability of quantum states by use of the convex analysis about joint numerical range of operators on a Hilbert space. We show that any two orthogonal pure states are distinguishable by local operations and…

Quantum Physics · Physics 2009-11-11 Yoshiko Ogata

Convergence properties of binary stationary subdivision schemes for curves have been analyzed using the techniques of z-transforms and eigenanalysis. Eigenanalysis provides a way to determine derivative continuity at specific points based…

Graphics · Computer Science 2008-01-22 Christian Kuehn

We use classical invariant theory to construct invariants of complex graded Gorenstein algebras of finite vector space dimension. As a consequence, we obtain a way of extracting certain numerical invariants of quasi-homogeneous isolated…

Complex Variables · Mathematics 2012-07-03 M. G. Eastwood , A. V. Isaev

We prove that for any singular integral affine variety $X$ of finite presentation over a perfect field defined over $\mathbb Z$, there exists a smooth morphism from $Y$ onto $X$ such that $Y$ admits a resolution. That is, there exists a…

Algebraic Geometry · Mathematics 2025-07-30 Yi Hu

A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…

Logic · Mathematics 2018-02-12 Russell Miller , Alexandra Shlapentokh

Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. It has recently been shown that this problem is NP-hard. There is a highly inefficient `basic algorithm'…

Quantum Physics · Physics 2009-11-10 L. M. Ioannou , B. C. Travaglione , D. Cheung , A. K. Ekert
‹ Prev 1 4 5 6 7 8 10 Next ›