English
Related papers

Related papers: Intersection multiplicities of Noetherian function…

200 papers

We study the number of intersections of the nodal lines of an eigenfunction of the Laplacian on the standard torus with a fixed reference curve, that is, the number of zeros of the eigenfunction restricted to the curve. An upper bound is…

Analysis of PDEs · Mathematics 2014-02-05 Jean Bourgain , Zeev Rudnick

We give effective upper bounds for the number of purely inseparable points on non isotrivial curves over function fields of positive characteristic and of transcendence degree one. These bounds depend on the genus of the curve, the genus of…

Algebraic Geometry · Mathematics 2019-11-07 Damian Rössler

Let f be a polynomial of degree at least 2 with coefficients in a number field K, let x_0 be a sufficiently general element of K, and let alpha be a root of f. We give precise conditions under which Newton iteration, started at the point…

Number Theory · Mathematics 2010-10-12 Xander Faber , José Felipe Voloch

We define the Milnor number -- as the intersection number of two holomorphic sections -- of a one-dimensional holomorphic foliation $\mathscr{F}$ with respect to a compact connected component $C$ of its singular set. Under certain…

Complex Variables · Mathematics 2023-02-10 Arturo Fernández-Pérez , Gilcione Nonato Costa , Rudy Rosas

Some easily verifiable sufficient conditions for the nonexistence of iterative roots for multifunctions on arbitrary nonempty sets are presented. Typically if the graph of the multifunction has a distinguished point with a relatively large…

Dynamical Systems · Mathematics 2022-12-13 B. V. Rajarama Bhat , Chaitanya Gopalakrishna

A uniform bound of intersection multiplicities of curves and divisors on abelian varieties is proved by algebraic geometric methods. It extends and improves a result obtained by A. Buium with a different method based on Kolchin's…

Algebraic Geometry · Mathematics 2007-05-23 Junjiro Noguchi , Joerg Winkelmann

Let X be a homogeneous tree of degree q+1 (for q between 2 and infinity) and let f be a complex function on X times X for which f(x,y) only depend on the distance between x and y in X. Our main result gives a necessary and sufficient…

Group Theory · Mathematics 2009-09-01 Uffe Haagerup , Troels Steenstrup , Ryszard Szwarc

The notion of epsilon multiplicity was originally defined by Ulrich and Validashti as a limsup and they used it to detect integral dependence of modules. It is important to know if it can be realized as a limit. In this article we show that…

Commutative Algebra · Mathematics 2021-09-28 Suprajo Das

Let $\chi$ be an order $c$ multiplicative character of a finite field and $f(x)=x^d+\lambda x^e$ a binomial with $(d,e)=1$. We study the twisted classical and $T$-adic Newton polygons of $f$. When $p>(d-e)(2d-1)$, we give a lower bound of…

Number Theory · Mathematics 2021-10-01 Shenxing Zhang

Let $\mathcal{F}_{n}^*$ be the set of Boolean functions depending on all $n$ variables. We prove that for any $f\in \mathcal{F}_{n}^*$, $f|_{x_i=0}$ or $f|_{x_i=1}$ depends on the remaining $n-1$ variables, for some variable $x_i$. This…

Computational Complexity · Computer Science 2015-02-05 Chia-Jung Lee , Satya V. Lokam , Shi-Chun Tsai , Ming-Chuan Yang

We present effective upper bounds on the symmetric bilinear complexity of multiplication in extensions of a base finite field Fp2 of prime square order, obtained by combining estimates on gaps between prime numbers together with an optimal…

Number Theory · Mathematics 2018-01-04 Hugues Randriam

We give universal bounds on the fraction of nontrivial zeros having given multiplicity for L-functions attached to a cuspidal automorphic representation of $\mathrm{GL}_m/\mathbb{Q}$. For this, we apply the higher-level correlation…

Number Theory · Mathematics 2025-03-21 Felipe Gonçalves , David de Laat , Nando Leijenhorst

We study non-compact surfaces obtained by gluing strips $\mathbb{R}\times(-1,1)$ with at most countably many boundary intervals along some these intervals. Every such strip possesses a foliation by parallel lines, which gives a foliation on…

Geometric Topology · Mathematics 2017-10-19 Sergiy Maksymenko , Eugene Polulyakh

In this note, we first bound the intersection number of the regular simplicial partitions.

Metric Geometry · Mathematics 2022-11-09 Zhiheng Zhang

We present the first polytope volume formulas for the multiplicities of affine fusion, the fusion in Wess-Zumino-Witten conformal field theories, for example. Thus, we characterise fusion multiplicities as discretised volumes of certain…

High Energy Physics - Theory · Physics 2009-11-07 Jorgen Rasmussen , Mark A. Walton

R. M. Brown's theorem on mixed Dirichlet and Neumann boundary conditions is extended in two ways for the special case of polyhedral domains. A (1) more general partition of the boundary into Dirichlet and Neumann sets is used on (2)…

Analysis of PDEs · Mathematics 2008-03-07 Moises Venouziou , Gregory C. Verchota

An enumerative problem on a variety $V$ is usually solved by reduction to intersection theory in the cohomology of a compactification of $V$. However, if the problem is invariant under a "nice" group action on $V$ (so that $V$ is…

Algebraic Geometry · Mathematics 2018-02-02 Alexander Esterov

A long-standing open problem in representation stability is whether every finitely generated commutative algebra in the category of strict polynomial functors satisfies the noetherian property. In this paper, we resolve this problem…

Commutative Algebra · Mathematics 2025-06-19 Karthik Ganapathy

We classify fields having finitely many finite non-commutative (not necessarily central) division algebras over them. In the process, we introduce the notion of anti-closure of a field and also make comments on fields having a linear…

Rings and Algebras · Mathematics 2023-09-18 Snehinh Sen

We consider straight line drawings of a planar graph $G$ with possible edge crossings. The \emph{untangling problem} is to eliminate all edge crossings by moving as few vertices as possible to new positions. Let $fix(G)$ denote the maximum…

Computational Geometry · Computer Science 2011-11-14 Alexander Ravsky , Oleg Verbitsky
‹ Prev 1 4 5 6 7 8 10 Next ›