中文
相关论文

相关论文: The Wonderful Geometry of the Vandermonde map

200 篇论文

A one parameter set of noncommutative complex algebras is given. These may be considered deformation quantisation algebras. The commutative limit of these algebras correspond to the algebra of polynomial functions over a manifold or…

量子代数 · 数学 2009-11-10 Jonathan Gratus

Let f be a dominating meromorphic self-map of large topological degree on a compact Kaehler manifold. We give a new construction of the equilibrium measure of f and prove that it is exponentially mixing. Then, we deduce the central limit…

动力系统 · 数学 2007-05-23 Tien-Cuong Dinh , Nessim Sibony

An n-variate Vandermonde polynomial is the determinant of the n x n matrix where the ith column is the vector (1, x_i, x_i^2, ...., x_i^{n-1})^T. Vandermonde polynomials play a crucial role in the theory of alternating polynomials and occur…

计算复杂性 · 计算机科学 2017-05-10 C. Ramya , B. V. Raghavendra Rao

We give lower bounds for the degree of the discriminant with respect to y of separable polynomials f in K[x,y] over an algebraically closed field of characteristic zero. Depending on the invariants involved in the lower bound, we give a…

代数几何 · 数学 2015-07-07 Denis Simon , Martin Weimann

Wigner's theorem characterizes isometries of the set of all rank one projections on a Hilbert space. In metric geometry nonexpansive maps and noncontractive maps are well studied generalizations of isometries. We show that under certain…

数学物理 · 物理学 2025-08-20 Michiya Mori , Peter Šemrl

We characterize the combinatorial types of symmetric frameworks in the plane that are minimally generically symmetry-forced infinitesimally rigid when the symmetry group consists of rotations and translations. Along the way, we use tropical…

组合数学 · 数学 2021-12-09 Daniel Irving Bernstein

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…

计算复杂性 · 计算机科学 2012-10-30 Nicolas de Rugy-Altherre

We prove the uniform hyperbolicity of the near-parabolic renormalization operators acting on an infinite-dimensional space of holomorphic transformations. This implies the universality of the scaling laws, conjectured by physicists in the…

动力系统 · 数学 2015-09-28 Davoud Cheraghi , Mitsuhiro Shishikura

Using Lavaurs maps and near-parabolic renormalization, we describe the degenerating geometry of external rays for quadratic polynomials when a periodic cycle becomes parabolic. We similarly describe the geometry of parameter rays for the…

动力系统 · 数学 2025-01-06 Alex Kapiamba

We study polynomials with complex coefficients which are nondegenerate in two senses, one of Kouchnirenko and the other with respect to its Newton polyhedron, through data on contact loci and motivic nearby cycles. Introducing an explicit…

代数几何 · 数学 2021-09-14 Quy Thuong Lê , Tat Thang Nguyen

We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…

计算复杂性 · 计算机科学 2025-11-21 Srinivas Balaji Bollepalli

Many (if not most) of convex polytopes, important for combinatorial and algebraic geometry, are closely related to secondary polytopes of point configurations, or base polytopes of submodular functions, or their numerous variations and…

组合数学 · 数学 2024-11-05 Alexander Esterov , Arina Voorhaar

Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthogonal surfaces in one or two dimensions are rather trivial…

组合数学 · 数学 2007-05-23 Stefan Felsner , Sarah Kappes

We study the exponential map of connected symmetric spaces and characterize, in terms of midpoints and of infinitesimal conditions, when it is a diffeomorphism, generalizing the Dixmier-Saito theorem for solvable Lie groups. We then give a…

微分几何 · 数学 2015-07-27 Yannick Voglaire

Given a dense countable set in a metric space, the infinite random geometric graph is the random graph with the given vertex set and where any two points at distance less than 1 are connected, independently, with some fixed probability. It…

组合数学 · 数学 2021-05-21 Omer Angel , Yinon Spinka

Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…

环与代数 · 数学 2007-05-23 Edward S. Letzter

We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…

组合数学 · 数学 2012-03-13 Igor Artemenko

From the work of Phong and Sturm in 2007, for a polarised projective manifold and an ample test configuration, one can associate the geodesic ray of plurisubharmonic metrics on the polarising line bundle using the solution of the…

微分几何 · 数学 2024-11-08 Siarhei Finski

In this paper, we consider a one-parameter family of degree $d\ge 2$ rational maps with an automorphism group containing the cyclic group of order $d$. We construct a polynomial whose roots correspond to parameter values for which the…

数论 · 数学 2021-01-26 Minsik Han

The metric dimension of non-component graph, associated to a finite vector space, is determined. It is proved that the exchange property holds for resolving sets of the graph, except a special case. Some results are also related to an…

组合数学 · 数学 2016-03-22 Usman Ali , Syed Ahtisham Bokhary , Khola Wahid