中文
相关论文

相关论文: The Varchenko Determinant for Apartments

200 篇论文

A characteristic polynomial is an important invariant in the field of hyperplane arrangement. For the Linial arrangement of any irreducible root system, Postnikov and Stanley conjectured that all roots of the characteristic polynomial have…

组合数学 · 数学 2020-12-11 Shigetaro Tamura

Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…

离散数学 · 计算机科学 2011-06-24 Giovanni Rossi

We compute hyperdeterminants of hypermatrices whose indices belongs in a meet-semilattice and whose entries depend only of the greatest lower bound of the indices. One shows that an elementary expansion of such a polynomial allows to…

组合数学 · 数学 2007-05-23 Jean-Gabriel Luque

For a given Markov chain Monte Carlo algorithm we introduce a distance between two configurations that quantifies the difficulty of transition from one configuration to the other configuration. We argue that the distance takes a universal…

高能物理 - 格点 · 物理学 2018-03-21 Masafumi Fukuma , Nobuyuki Matsumoto , Naoya Umeda

We consider a function $U=e^{-f_0}\prod_j^N f_j^{\alpha_j}$ on a real affine space, here $f_0,..,f_N$ are linear functions, $\alpha_1, ...,\alpha_N$ complex numbers. The zeros of the functions $f_1, ..., f_N$ form an arrangement of…

alg-geom · 数学 2008-02-03 Y. Markov , V. Tarasov , A. Varchenko

The set of chambers of a real hyperplane arrangement may be ordered by separation from some fixed chamber. When this poset is a lattice, Bjorner, Edelman, and Ziegler proved that the chambers are in natural bijection with the biconvex sets…

组合数学 · 数学 2014-11-06 Thomas McConville

We find that multidimensional determinants "hyperdeterminants", related to entanglement measures (the so-called concurrence or 3-tangle for the 2 or 3 qubits, respectively), are derived from a duality between entangled states and separable…

量子物理 · 物理学 2009-11-07 Akimasa Miyake

In this paper we shed more light on determinants of interval matrices. Computing the exact bounds on a determinant of an interval matrix is an NP-hard problem. Therefore, attention is first paid to approximations. NP-hardness of both…

数值分析 · 数学 2018-09-12 Jaroslav Horáček , Milan Hladík , Josef Matějka

Determining the number of pieces after cutting a cake is a classical problem. Roberts (1887) provided an exact solution by computing the number of chambers contained in a plane cut by lines. About 88 years later, Zaslavsky (1975) even…

组合数学 · 数学 2023-08-28 Hery Randriamaro

Chen et al. recently established bijections for $(d+1)$-noncrossing/ nonnesting matchings, oscillating tableaux of bounded height $d$, and oscillating lattice walks in the $d$-dimensional Weyl chamber. Stanley asked what is the total number…

组合数学 · 数学 2007-05-23 Guoce Xin

We show a combinatorial formula for a lower bound of the dimension of the non-unipotent monodromy part of the first Milnor cohomology of a hyperplane arrangement satisfying some combinatorial conditions. This gives exactly its dimension if…

代数几何 · 数学 2010-05-18 Nero Budur , Alexandru Dimca , Morihiko Saito

Let $P_N(R)$ be the space of all real polynomials in $N$ variables with the usual inner product $<, >$ on it, given by integrating over the unit sphere. We start by deriving an explicit combinatorial formula for the bilinear form…

数论 · 数学 2009-12-14 Lenny Fukshansky

Let $ V $ a vector space of dimension $n$. A $V$ family $ \{H_1, \ldots, H_p \} $ of vectorial hyperplanes being distinct two by two defines an arrangement $ {\cal A}_p = {\cal A} ( H_1, \ldots ,H_p ) $ of $ V $. For $ i \in \{ 1, \ldots, p…

代数几何 · 数学 2016-10-12 Philippe Maisonobe

A theorem of Mandel allows to determine the covector set of an oriented matroid from its set of topes by using the composition condition. We provide a generalization of that result, stating that the covector set of a conditional oriented…

组合数学 · 数学 2023-09-20 Hery Randriamaro

The main aim of this paper is to generalize the concept of vector space by the hyperstructure. We generalize some definitions such as hypersubspaces, linear combination, Hamel basis, linearly dependence and linearly independence. A few…

综合数学 · 数学 2011-06-08 Sanjay Roy , T. K. Samanta

In this paper, we build the global determinant method of Salberger by Arakelov geometry explicitly. As an application, we study the dependence on the degree of the number of rational points of bounded height in plane curves. We will also…

数论 · 数学 2022-05-24 Chunhui Liu

We prove a constant term conjecture of Robbins and Zeilberger (J. Combin. Theory Ser. A 66 (1994), 17-27), by translating the problem into a determinant evaluation problem and evaluating the determinant. This determinant generalizes the…

组合数学 · 数学 2007-05-23 Christian Krattenthaler

Using some resolution of singularities methods of the author, a generalization of a well-known theorem of Varchenko relating decay of oscillatory integrals to the Newton polyhedron is proven. They are derived from analogous results for…

经典分析与常微分方程 · 数学 2009-06-09 Michael Greenblatt

We study Pythagorean hyperplane arrangements, originally defined by Zaslavsky. In this first part of a series on such arrangements, we introduce a new notion of genericity for such arrangements. Using this notion we construct an auxiliary…

组合数学 · 数学 2023-08-22 Chris Eppolito

The hyperdeterminant of a polynomial (interpreted as a symmetric tensor) factors into several irreducible factors with multiplicities. Using geometric techniques these factors are identified along with their degrees and their…

代数几何 · 数学 2025-10-16 Luke Oeding