Related papers: Parametrization by polytopes of intersections of o…

Given any full rank lattice and a natural number N , we regard the point set given by the scaled lattice intersected with the unit square under the Lambert map to the unit sphere, and show that its spherical cap discrepancy is at most of…

A convex quadrilateral, $Q$, is called a midpoint diagonal quadrilateral if the intersection point of the diagonals of $Q$ coincides with the midpoint of at least one of the diagonals of $Q$. A parallelogram, P, is a special case of a…

Take n>k>1 such that n-k is odd. In this paper we consider mapping a from (n-k+1)-dimensional closed ball into the space of (n \times k)--matrices such that its restriction to a sphere goes into the Stiefel manifold V_k(R^n). We construct a…

We study the orbit of $\mathbb{R}$ under the Bianchi group $\operatorname{PSL}_2(\mathcal{O}_K)$, where $K$ is an imaginary quadratic field. The orbit, called a Schmidt arrangement $\mathcal{S}_K$, is a geometric realisation, as an…

We study maps on the set of permutations of n generated by the R\'enyi-Foata map intertwined with other dihedral symmetries (of a permutation considered as a 0-1 matrix). Iterating these maps leads to dynamical systems that in some cases…

We apply the method of orbit harmonics to the set of break divisors and orientable divisors on graphs to obtain the central and external zonotopal algebras respectively. We then relate a construction of Efimov in the context of…

Identifying symmetries in data sets is generally difficult, but knowledge about them is crucial for efficient data handling. Here we present a method how neural networks can be used to identify symmetries. We make extensive use of the…

A parametric curve $\gamma$ of class $C^n$ on the $n$-sphere is said to be nondegenerate (or locally convex) when $\det\left(\gamma(t),\gamma'(t),\cdots,\gamma^{(n)}(t)\right)>0$ for all values of the parameter $t$. We orthogonalize this…

Let $Y$ be a hyperbolic surface and let $\phi$ be a Laplacian eigenfunction having eigenvalue $-1/4-\tau^2$ with $\tau>0$. Let $N(\phi)$ be the set of nodal lines of $\phi$. For a fixed analytic curve $\gamma$ of finite length, we study the…

Let $ G $ be a connected reductive algebraic group over $ \mathbb{R} $, and $ H $ its symmetric subgroup. For parabolic subgroups $ P_{G} \subset G $ and $ P_{H} \subset H $, the product of flag varieties $ \mathfrak{X} = H/P_H \times G/P_G…

This thesis studies the symplectic structure of holomorphic coadjoint orbits, and their projections. A holomorphic coadjoint orbit O is an elliptic coadjoint orbit which is endowed with a natural invariant K\"ahlerian structure. These…

Let Lambda be a tiled R-order. We give a description of Aut_R(Lambda) as the semidirect product of Inn(Lambda) and a certain subgroup of Aut(Q(Lambda)), where Q(Lambda) is the link graph of Lambda. Additionally, we give criteria for…

We study the harmonic polytope, which arose in Ardila, Denham, and Huh's work on the Lagrangian geometry of matroids. We describe its combinatorial structure, showing that it is a $(2n-2)$-dimensional polytope with…

An n-dimensional polytope P^n is called simple if exactly n codimension-one faces meet at each vertex. The lattice of faces of a simple polytope P^n with m codimension-one faces defines an arrangement of even-dimensional planes in R^{2m}.…

Let G be a complex reductive algebraic group. We study complete intersections in a spherical homogeneous space G/H defined by a generic collection of sections from G-invariant linear systems. Whenever nonempty, all such complete…

A periodic tridiagonal matrix is a tridiagonal matrix with additional two entries at the corners. We study the space $X_{n,\lambda}$ of Hermitian periodic tridiagonal $n\times n$-matrices with a fixed simple spectrum $\lambda$. Using the…

Let $\Gamma$ be the fundamental group of a closed orientable surface of genus at least two. Consider the composition of a uniformly random element of $\mathrm{Hom}(\Gamma,S_n)$ with the $(n-1)$-dimensional irreducible representation of…

The orbit graph of a k-orbit polytope is a graph on k nodes that shows how the flag orbits are related by flag adjacency. Using orbit graphs, we classify k-orbit polytopes and determine when a k-orbit polytope is i-transitive. We then…

Matroids, particularly linear ones, have been a powerful tool in parameterized complexity for algorithms and kernelization. They have sped up or replaced dynamic programming. Delta-matroids generalize matroids by encapsulating structures…

The intersection matrix of a simplicial complex has entries equal to the rank of the intersection of its facets. In [1] the authors prove the intersection matrix is enough to determine a triangulation of a surface up to isomorphism. In this…