Related papers: Limits of Cartier divisors
The divisor theory of graphs views a finite connected graph $G$ as a discrete version of a Riemann surface. Divisors on $G$ are formal integral combinations of the vertices of $G$, and linear equivalence of divisors is determined by the…
We estimate the expected number of limit cycles situated in a neighbourhood of the origin of a planar polynomial vector field. Our main tool is a distributional inequality for the number of zeros of some families of univariate holomorphic…
The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…
In this article, we compile the work done by various mathematicians on the topic of the fixed divisor of a polynomial. This article explains most of the results concisely and is intended to be an exhaustive survey. We present the results on…
Arithmetic quotients are quotients of bounded symmetric domains by arithmetic groups, and modular subvarieties of arithmetic quotients are themselves arithmetic quotients of lower dimension which live on arithmetic quotients, by an…
We unify Linear Algebra by proposing a definition of determinants via one equation that implies all known properties of them:\\ 1. Cramer's Rule,\\ 2. Cofactor expansion,\\ 3. Antisymmetry of determinants,\\ 4. Linearity of determinants,\\…
A tame filtration of an algebra is defined by the growth of its terms, which has to be majorated by an exponential function. A particular case is the degree filtration used in the definition of the growth of finitely generated algebras. The…
We show that the total Cartier index of varieties with rational singularities in a bounded family is bounded. This solves a problem of Han and Jiang. The overall structure of the proof, which treats the surface case and the…
The purpose of this article is to describe and characterize the limit distributions of translates of a bounded open "piece of orbit" of a reductive subgroup on a space of S-arithmetic lattices. This is accomplished under a mild assumption…
The determination of weight distribution of cyclic codes involves evaluation of Gauss sums and exponential sums. Despite of some cases where a neat expression is available, the computation is generally rather complicated. In this note, we…
In this paper, we first characterize which generalized lexicographic products are divisor graphs. As applications, we show that power graphs, reduced power graphs and order graphs are all divisor graphs, which also implies the main result…
Lienard systems are very important mathematical models describing oscillatory processes arising in applied sciences. In this paper, we study polynomial Lienard systems of arbitrary degree on the plane, and develop a new method to obtain a…
Ore proved that a finite group is cyclic if and only if its subgroup lattice is distributive. Now, since every subgroup of a cyclic group is normal, we call a subfactor planar algebra cyclic if all its biprojections are normal and form a…
Given a finite abelian group $G$, consider the complete graph on the set of all elements of $G$. Find a Hamiltonian cycle in this graph and for each pair of consecutive vertices along the cycle compute their sum. What are the smallest and…
For a Riemann integrable function on an interval and for a point therein,we define 'Fourier series at the point on the interval' and bring out how and when the function element becomes expressible as Fourier series.In this process,we also…
We characterize universally generalizing morphisms which satisfy descent of algebraic cycles integrally as those universally generalizing morphisms which are surjective with generically reduced fibres. In doing so, we introduce a naive…
We establish a parameter-dependent pseudo-differential calculus on an infinite cylinder, regarded as a manifold with conical exits to infinity. The parameters are involved in edge-degenerate form, and we formulate the operators in terms of…
Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…
A notion of degeneration of elements in groups is introduced. It is used to parametrize the orbits in a finite abelian group under its full automorphism group by a finite distributive lattice. A pictorial description of this lattice leads…
We obtain sharp bounds for the number of n-cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. En route, we prove some sharp estimates on power…