相关论文: The Varchenko Determinant for Apartments
We show that the idea used by Kempf (1990) in order to obtain a splitting criterion for vector bundles on projective spaces leads to an elementary proof of the Babylonian tower theorem for this class of bundles, a result due to Barth--Van…
A pair of uncertainty relations relevant for quantum states of multislit interferometry is derived, based on the mutually commuting "modular" position and momentum operators and their complementary counterparts, originally introduced by…
The purpose of this note is to prove the existence of a remarkable structure in an iterated sumset derived from a set $P$ in a Cartesian square $\mathbb{F}_p^n\times\mathbb{F}_p^n$. More precisely, we perform horizontal and vertical sums…
We calculate exactly the functional determinant for fermions in fundamental representation of SU(2) in the background of periodic instanton with non-trivial value of the Polyakov line at spatial infinity. The determinant depends on the…
A theorem is proved concerning approximation of analytic functions by multivariate polynomials in the $s$-dimensional hypercube. The geometric convergence rate is determined not by the usual notion of degree of a multivariate polynomial,…
In this paper we derive higher order convergence rates in terms of the Bregman distance for Tikhonov like convex regularisation for linear operator equations on Banach spaces. The approach is based on the idea of variational inequalities,…
Kaltofen has proposed a new approach in [Kaltofen 1992] for computing matrix determinants. The algorithm is based on a baby steps/giant steps construction of Krylov subspaces, and computes the determinant as the constant term of a…
Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…
Given a multiarrangement of hyperplanes we define a series by sums of the Hilbert series of the derivation modules of the multiarrangement. This series turns out to be a polynomial. Using this polynomial we define the characteristic…
Elaboration of some fundamental relations in three dimensional quantum mechanics is considered taking into account the restricted character of areas in radial distance. In such cases the boundary behavior of the radial wave function and…
We introduce a measure of decoherence for a class of density operators. For Gaussian density operators in dimension one it coincides with an index used by Morikawa (1990). Spatial decoherence rates are derived for three large classes of the…
We develop a nonoverlapping domain decomposition preconditioner for the $C^0$ interior penalty method, a discontinuous Galerkin method, for the biharmonic problem. The preconditioner is based on balancing domain decomposition by constraints…
We derive expressions for the partition function p(n), with n in the form 7k+a, as (k+1)-dimensional determinants.
We show that the d-cube is determined by the spectrum of its distance matrix.
In the paper [J. Combin. Theory Ser. A 43 (1986), 103--113], Stanley gives formulas for the number of plane partitions in each of ten symmetry classes. This paper together with results by Andrews [J. Combin. Theory Ser. A 66 (1994), 28-39]…
The effect of Kolmogorov-Arnold-Moser (KAM) theorem in quantum systems is manifested in dividing eigenstates into regular and irregular states. We propose an effective method based on Wannier basis in phase space to illustrate this division…
In "Faces of a Hyperplane Arrangement Enumerated by Ideal Dimension, with Applications to Plane, Plaids, and Shi," Zaslavsky showed how to compute the number $r_\ell(\mathcal{A})$ of regions of a real hyperplane arrangement $\mathcal{A}$…
We define quantum determinants in Quantum Matrix Algebras, related to couples of compatible braidings following the scheme from [G]. We establish relations between these determinants and the so-called column-(row-)determinants, often used…
The Vapnik-Chervonenkis dimension is a combinatorial parameter that reflects the "complexity" of a set of sets (a.k.a. concept classes). It has been introduced by Vapnik and Chervonenkis in their seminal 1971 paper and has since found many…
Determinantal polynomials play a crucial role in semidefinite programming problems. Helton-Vinnikov proved that real zero (RZ) bivariate polynomials are determinantal. However, it leads to a challenging problem to compute such a…