Related papers: Multiple equivalent matings with the aeroplane pol…
The aim of this paper is to provide the sufficient condition for a mass distribution in R^d to admit an equipartition with a collection of hyperplanes some of which are parallel. The results extend the previously obtained results for the…
We prove that the Eulerian polynomial satisfies certain polynomial congruences. Furthermore, these congruences characterize the Eulerian polynomial.
We show that polynomial time Turing equivalence and a large class of other equivalence relations from computational complexity theory are universal countable Borel equivalence relations. We then discuss ultrafilters on the invariant Borel…
We consider a class of homogeneous self-similar sets with complete overlaps and give a sufficient condition for the Lipschitz equivalence between members in this class.
Schemes for exact multiplication of small matrices have a large symmetry group. This group defines an equivalence relation on the set of multiplication schemes. There are algorithms to decide whether two schemes are equivalent. However, for…
The cutting plane approach to optimal matchings has been discussed by several authors over the past decades (e.g., Padberg and Rao '82, Grotschel and Holland '85, Lovasz and Plummer '86, Trick '87, Fischetti and Lodi '07) and its…
Matrix congruence can be used to mimic linear maps between homogeneous quadratic polynomials in $n$ variables. We introduce a generalization, called standard-form congruence, which mimics affine maps between non-homogeneous quadratic…
Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…
With an easily applicable criterion based on permutation symmetries of (identically prepared) replicas of quantum states we identify distinct entanglement classes in high-dimensional multi- partite systems. The different symmetry properties…
Planar coincidence site lattices and modules with N-fold symmetry are well understood in a formulation based on cyclotomic fields, in particular for the class number one case, where they appear as certain principal ideals in the…
We define and study the Tutte polynomial of a hyperplane arrangement. We introduce a method for computing it by solving an enumerative problem in a finite field. For specific arrangements, the computation of Tutte polynomials is then…
Our aim is to generalize the result that two generic complex line arrangements are equivalent. In fact for a line arrangement A we associate its defining polynomial, the product of a_ix+b_iy+c_i, so that A = (f=0). We prove that the…
Given a set $P$ of $n$ points in the plane, where $n$ is even, we consider the following question: How many plane perfect matchings can be packed into $P$? We prove that at least $\lceil\log_2{n}\rceil-2$ plane perfect matchings can be…
We give a canonical form of m-by-2-by-2 spatial matrices for equivalence over any field.
We compute Bernstein-Sato polynomials of some pairs of topologically equivalent plane curve singularities. Some pairs have the same Tjurina number but distinct Bernstein-Sato polynomials, which implies that they are not analytically…
An interpretation of the multiple Meixner polynomials of the first kind is provided through an infinite Lie algebra realized in terms of the creation and annihilation operators of a set of independent oscillators. The model is used to…
Two plane analytic branches are topologically equivalent if and only if they have the same multiplicity sequence. We show that having same semigroup is equivalent to having same multiplicity sequence, we calculate the semigroup from a…
We prove matching direct and inverse theorems for uniform polynomial approximation with $A^*$ weights (a subclass of doubling weights suitable for approximation in the $L_\infty$ norm) having finitely many zeros and not too "rapidly…
We present a simple and convenient analytical formula for efficient exact computation of the hafnian of Toeplitz matrices of a special type. An interpretation of the obtained results is given in the language of perfect matchings and Bessel…
We extend the authors' previous work on Wiener-Wintner double recurrence theorem to the case of polynomials.