中文
相关论文

相关论文: Des s\'eries de tissus ordinaires de rang maximum …

200 篇论文

We generalize to webs of any codimension results already known in codimension one. Given a holomorphic $d$-web $\cal W$ of codimension $q$ $(q\leq n-1)$ in an ambiant $n$-dimensional holomorphic manifold $U$, we define for any integer $p$…

微分几何 · 数学 2022-01-03 Daniel Lehmann

We are interested by holomorphic $d$-webs $W$ of codimension one in a complex $n$-dimensional manifold $M$. If they are ordinary, i.e. if they satisfy to some condition of genericity (whose precise definition is recalled), we proved in [CL]…

微分几何 · 数学 2017-03-13 Jean Paul Dufour , Daniel Lehmann

The main change with respect to the previous version is a change of terminology : we call "ordinary" the webs previously called "regular". A holomorphic $d$-web of codimension one in dimension $n$ is "ordinary", if it satisfies to some…

动力系统 · 数学 2008-10-13 Vincent Cavalier , Daniel Lehmann

We present a MAPLE program for the explicit computation of the curvature of calibrated ordinary webs in codimension one in any dimension (recall that all planar webs are calibrated and ordinary). The vanishing of this curvature means the…

微分几何 · 数学 2014-08-19 Jean-Paul Dufour , Daniel Lehmann

We show that a web of codimension at least two and of maximal rank is isomorphic to an algebraic web. This solves a problem first consdered by Chern and Griffiths.

代数几何 · 数学 2013-02-14 Pirio Luc , Trépreau Jean-Marie

A scheme $X\subset \PP^{n+c}$ of codimension $c$ is called {\em standard determinantal} if its homogeneous saturated ideal can be generated by the maximal minors of a homogeneous $t \times (t+c-1)$ matrix and $X$ is said to be {\em good…

代数几何 · 数学 2007-05-23 Jan O. Kleppe , Rosa M. Miro-Roig

For any d-web by curves in an ambiant n-dimensional manifold, we define a tautological connection on some associated bundle, whose curvature vanishes iff the web has a maximal (n-1)-rank. As an application we recover, with the help of a…

微分几何 · 数学 2024-01-30 Lehmann Daniel

Any simple group-grading of a finite dimensional complex algebra induces a natural family of digraphs. We prove that $|E\circ E^{\text{op}}\cup E^{\text{op}}\circ E|\geq |E|$ for any digraph $\Gamma =(V,E)$ without parallel edges, and…

环与代数 · 数学 2013-05-22 Yuval Ginosar , Ofir Schnabel

The authors lay the foundations for the study of normal families of holomorphic functions and mappings on an infinite-dimensional normed linear space. Characterizations of normal families, in terms of value distribution, spherical…

复变函数 · 数学 2007-05-23 Kang-Tae Kim , Steven Krantz

Codimension one webs are configurations of finitely many codimension one foliations in general position. Much of the classical theory evolved around the concept of abelian relation: a functional relation among the first integrals of the…

复变函数 · 数学 2010-04-02 Jorge Vitorio Pereira , Luc Pirio

We find an invariant characterization of planar webs of maximum rank. For 4-webs, we prove that a planar 4-web is of maximum rank three if and only if it is linearizable and its curvature vanishes. This result leads to the direct…

微分几何 · 数学 2007-05-23 Vladislav V. Goldberg , Valentin V. Lychagin

We revisit the phenomenon where, for certain domains $D$, if the squeezing function $s_D$ extends continuously to a point $p\in \partial{D}$ with value $1$, then $\partial{D}$ is strongly pseudoconvex around $p$. In $\mathbb{C}^2$, we…

复变函数 · 数学 2023-02-24 Gautam Bharali

The Weisfeiler-Leman (WL) algorithms form a family of incomplete approaches to the graph isomorphism problem. They recently found various applications in algorithmic group theory and machine learning. In fact, the algorithms form a…

离散数学 · 计算机科学 2025-10-29 Thomas Schneider , Pascal Schweitzer

We consider a family $\mathscr{F}$ of meromorphic functions defined in a domain $D$, a holomorphic function $\psi$ and a homogeneous differential polynomial $ P[f] $ of degree $d$ with weight $w$. In this paper, we prove the normality of…

复变函数 · 数学 2026-03-13 Kuntal Mandal , Bipul Pal

In this paper tackle the problem of computing the ranks of certain eulerian magnitude homology groups of a graph G. First, we analyze the computational cost of our problem and prove that it is #W[1]-complete. Then we develop the first…

计算复杂性 · 计算机科学 2024-10-15 Giuliamaria Menara , Luca Manzoni

The aim of this paper is mainly, after some theoretical explanations, to provide a program on Maple for computing, whatever be d, the curvature of the planar d-web implicitely defined by a differential equation F(x,y,y')=0, F being…

微分几何 · 数学 2015-05-04 Jean-Paul Dufour , Daniel Lehmann

Let $1\leq p\leq n$ be two positive integers. For a linearly nondegenerate holomorphic mapping $f\colon\mathbb{C}^p\rightarrow\mathbb{P}^n(\mathbb{C})$ of maximal rank intersecting a family of hyperplanes in general position, we obtain a…

复变函数 · 数学 2024-07-24 Dinh Tuan Huynh

Let A be a k-vector space of dimension a. A subvector space M of End(A) is said to be of rank r if every non-zero f in M has rank r. The problem considered in this paper is to determine l(r;a) the maximal dimension of a rank r subspace of…

代数几何 · 数学 2015-08-04 Philippe Ellia , Paolo Menegatti

In this paper, we study the fibers of "automorphic word maps", a certain generalization of word maps, on finite groups and on nonabelian finite simple groups in particular. As an application, we derive a structural restriction on finite…

群论 · 数学 2016-10-14 Alexander Bors

We prove that a d-web near a point in n-space, where n is greater than 2 and d is greater than 2n-1, is equivalent to an algebraic web, if it has maximal rank or, more generally, if it has (2d - 3n + 1) abelian relations the 1-jets of which…

微分几何 · 数学 2007-05-23 Jean-Marie Trépreau
‹ 上一页 1 2 3 10 下一页 ›