English
Related papers

Related papers: Tangent Codes

200 papers

We study the $m$-th Gauss map in the sense of F.~L.~Zak of a projective variety $X \subset \mathbb{P}^N$ over an algebraically closed field in any characteristic. For all integer $m$ with $n:=\dim(X) \leq m < N$, we show that the contact…

Algebraic Geometry · Mathematics 2017-02-21 Katsuhisa Furukawa , Atsushi Ito

We first study Clarke's tangent cones at infinity to unbounded subsets of $\mathbb{R}^n.$ We prove that these cones are closed convex and show a characterization of their interiors. We then study subgradients at infinity for extended real…

Optimization and Control · Mathematics 2024-05-17 Minh Tung Nguyen , Tien-Son Pham

The universal Vassiliev-Kontsevich invariant is a functor from the category of tangles to a certain graded category of chord diagrams, compatible with the Vassiliev filtration and whose associated graded is an isomorphism. The Vassiliev…

Quantum Algebra · Mathematics 2014-10-01 Adrien Brochier

We study the set of tangent limits at a given point to a set definable in any o-minimal structure by characterizing the set of exceptional rays in the tangent cone to the set at that point and investigating the set of tangent limits along…

Algebraic Geometry · Mathematics 2020-10-08 Si Tiep Dinh , Olivier Le Gal , Tien Son Pham

It is shown that a canonical geometric setting of the integrable TED equation is a Kahlerian tangent bundle of an affine manifold. The remarkable multi-dimensional consistency of this 4+4-dimensional dispersionless partial differential…

Exactly Solvable and Integrable Systems · Physics 2024-02-20 W. K. Schief , U. Hertrich-Jeromin , B. G. Konopelchenko

We show that through a point of an affine variety there always exists a smooth plane curve inside the ambient affine space, which has the multiplicity of intersection with the variety at least 3. This result has an application to the study…

alg-geom · Mathematics 2016-08-30 Anvar R. Mavlyutov

Let Y be a compact reduced subspace of a complex manifold X, and let F be a subsheaf of the tangent bundle T_X which is closed under the Lie bracket. This paper discusses criteria to guarantee that infinitesimal deformations of the…

Algebraic Geometry · Mathematics 2011-03-30 Clemens Jörder , Stefan Kebekus

We study the problem of enumerating Tarski fixed points on finite lattices. We derive query complexity lower bounds for finding three or more Tarski fixed points of isotone maps and the subclasses of increasing and decreasing isotone maps.…

Discrete Mathematics · Computer Science 2026-04-28 Julian Müller

We give an alternative approach to the computation of the dimension of the tangent space of the deformation space of curves with automorphisms. A homological version of the local-global principle similar to the one of J.Bertin, A. M\'ezard…

Algebraic Geometry · Mathematics 2007-05-23 Aristides Kontogeorgis

This paper is an enhancement of the previous note "Explicit computations of Zariski decompositions on P_Z^1". In this paper, we observe several properties of a certain kind of an arithmetic divisor D on the n-dimensional projective space…

Algebraic Geometry · Mathematics 2015-01-14 Atsushi Moriwaki

Studying the generalized Hamming weights of linear codes is a significant research area within coding theory, as it provides valuable structural information about the codes and plays a crucial role in determining their performance in…

Information Theory · Computer Science 2024-05-31 Wei Lu , Qingyao Wang , Xiaoqiang Wang , Dabin Zheng

Suppose $TM\setminus \{0\}$ and $T\widetilde M\setminus\{0\}$ are slashed tangent bundles of two smooth manifolds $M$ and $\widetilde M$, respectively. In this paper we characterize those diffeomorphisms $F\colon TM\setminus\{0\} \to…

Differential Geometry · Mathematics 2011-10-06 Ioan Bucataru , Matias F. Dahl

We propose a general framework to study constructions of Euclidean lattices from linear codes over finite fields. In particular, we prove general conditions for an ensemble constructed using linear codes to contain dense lattices (i.e.,…

Information Theory · Computer Science 2018-02-06 Antonio Campello

The notion of an odd quasi-connection on a supermanifold, which is loosely an affine connection that carries non-zero Grassmann parity, is examined. Their torsion and curvature are defined, however, in general, they are not tensors. A…

Mathematical Physics · Physics 2022-06-29 Andrew James Bruce , Janusz Grabowski

To each subvariety $X$ in projective $n$-space of codimension $m$ we associate an integer sequence of length $m + 1$ from $1$ to the degree of $X$ recording the maximal cardinalities of finite, reduced intersections of $X$ with linear…

Algebraic Geometry · Mathematics 2020-03-20 Grayson Jorgenson

We study families of linear spaces in projective space whose union is a proper subvariety X of the expected dimension. We establish relations between configurations of focal points and existence or non-existence of a fixed tangent space to…

Algebraic Geometry · Mathematics 2007-05-23 Emilia Mezzetti , Orsola Tommasi

We establish endpoint Lebesgue space bounds for convolution and restricted X-ray transforms along curves satisfying fairly minimal differentiability hypotheses, with affine and Euclidean arclengths. We also explore the behavior of certain…

Classical Analysis and ODEs · Mathematics 2017-10-24 Spyridon Dendrinos , Betsy Stovall

Rank-metric codes are subspaces of matrices over finite fields endowed with the rank metric and admit a natural tensorial representation. The tensor rank provides a measure of the minimal size of a decomposition of a code into rank-one…

Information Theory · Computer Science 2026-05-22 Matteo Bonini , Eimear Byrne , Giuseppe Cotardo

There is an interesting potential theory associated to each degenerate elliptic, fully nonlinear equation $f(D^2u) = 0$. These include all the potential theories attached to calibrated geometries. This paper begins the study of tangents to…

Analysis of PDEs · Mathematics 2016-06-20 F. Reese Harvey , H. Blaine Lawson

A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that is linear in their code length, and (iii) they have a…

Information Theory · Computer Science 2016-11-17 Ron M. Roth , Vitaly Skachek