Related papers: Separation of analytic sets by rectangles of low c…
Let $\Gamma$ be a dual polar graph with diameter $D \geqslant 3$, having as vertices the maximal isotropic subspaces of a finite-dimensional vector space over the finite field $\mathbb{F}_q$ equipped with a non-degenerate form (alternating,…
We study the structure of the algebra of polynomial invariants for the usual conjugation action of the complex special, SO_n, and general, O_n, orthogonal group on the space of traceless n by n complex matrices. (Note that these two…
The notion of $\Gamma$-symmetric space is a natural generalization of the classical notion of symmetric space based on $\z_2$-grading of Lie algebras. In our case, we consider homogeneous spaces $G/H$ such that the Lie algebra $\g$ of $G$…
A commuting pair of Hilbert space operators having the closed symmetrized bidisc \[ \Gamma=\{(z_1+z_2, z_1z_2) \in \mathbb C^2 \ : \ |z_1| \leq 1, |z_2| \leq 1\} \] as a spectral set is called a \textit{$\Gamma$-contraction}. A…
We consider the numerical evaluation of a class of double integrals with respect to a pair of self-similar measures over a self-similar fractal set (the attractor of an iterated function system), with a weakly singular integrand of…
We construct a functor associating a cubical set to a (simple) graph. We show that cubical sets arising in this way are Kan complexes, and that the A-groups of a graph coincide with the homotopy groups of the associated Kan complex. We use…
Let $G$ be a bounded open subset of Euclidean space with real algebraic boundary $\Gamma$. Under the assumption that the degree $d$ of $\Gamma$ is given, and the power moments of the Lebesgue measure on $G$ are known up to order $3d$, we…
It has long been known that the combinatorial properties of a graph $\Gamma$ are closely related to the group theoretic properties of its right angled artin group (raag). It's natural to ask if the graph homomorphisms are similarly related…
Let $\Gamma$ be a $Q$-polynomial distance-regular graph with diameter at least $3$. Terwilliger (1993) implicitly showed that there exists a polynomial, say $T(\lambda)\in \mathbb{C}[\lambda]$, of degree $4$ depending only on the…
For $n > 2$, let $\Gamma$ denote either $SL(n, Z)$ or $Sp(n, Z)$. We give a practical algorithm to compute the level of the maximal principal congruence subgroup in an arithmetic group $H\leq \Gamma$. This forms the main component of our…
In this study, a geometric version of an NP-hard problem ("Almost $2-SAT$" problem) is introduced which has potential applications in clustering, separation axis, binary sensor networks, shape separation, image processing, etc. Furthermore,…
We describe a method for determining a complete set of integrals for a classical Hamiltonian that separates in orthogonal subgroup coordinates. As examples, we use it to determine complete sets of integrals, polynomial in the momenta, for…
A recent development in graph-minor theory is to study local separators, vertex-sets that separate graphs locally but not necessarily globally. The local separators of a graph roughly correspond to the genuine separators of its local…
We present a package to perform partial fraction decompositions of multivariate rational functions. The algorithm allows to systematically avoid spurious denominator factors and is capable of producing unique results also when being applied…
We generalise a result of Sawyer to show the following: For each y\in R^p and w\in R^q let \Gamma(y,w) be a measurable d-dimensional surface in R^n. Under conditions on the number of parameters and smoothness assumptions, there exists a set…
We report major advances in the research program initiated in "Moment-Based Evidence for Simple Rational-Valued Hilbert-Schmidt Generic 2 x 2 Separability Probabilities" (J. Phys. A, 45, 095305 [2012]). A highly succinct separability…
For large classes of group testing problems, we derive lower bounds for the probability that all significant items are uniquely identified using specially constructed random designs. These bounds allow us to optimize parameters of the…
In this paper, we determine the descriptive complexity of subsets of the Polish space of marked groups defined by various group theoretic properties. In particular, using Grigorchuk groups, we establish that the sets of solvable groups,…
Recently, Glasner, Tsankov, Weiss, and Zucker showed that if $\Gamma$ is an infinite discrete group, then every minimal $\Gamma$-flow is disjoint from the Bernoulli shift $2^\Gamma$. Their proof is somewhat involved; in particular, it…
We describe a polynomial time algorithm that takes as input a polygon with axis-parallel sides but irrational vertex coordinates, and outputs a set of as few rectangles as possible into which it can be dissected by axis-parallel cuts and…