English
Related papers

Related papers: A note on tight projective 2-designs

200 papers

Our goal is to provide a novel method of representing 2D shapes, where each shape will be assigned a unique fingerprint - a computable approximation to a conformal map of the given shape to a canonical shape in 2D or 3D space (see page 22…

Differential Geometry · Mathematics 2022-09-23 Sa'ar Hersonsky

In this paper we use the theory of computing to study fractal dimensions of projections in Euclidean spaces. A fundamental result in fractal geometry is Marstrand's projection theorem, which shows that for every analytic set E, for almost…

Computational Complexity · Computer Science 2021-11-15 Neil Lutz , D. M. Stull

We describe the integral equivariant cohomology ring of a weighted projective space in terms of piecewise polynomials, and thence by generators and relations. We deduce that the ring is a perfect invariant, and prove a Chern class formula…

Algebraic Topology · Mathematics 2009-04-15 Anthony Bahri , Matthias Franz , Nigel Ray

Dimension profiles were introduced by Falconer and Howroyd to provide formulae for the box-counting and packing dimensions of the orthogonal projections of a set E or a measure on Euclidean space onto almost all m-dimensional subspaces. The…

Metric Geometry · Mathematics 2018-11-22 K. J. Falconer

We consider two-dimensional directed polymers in random environment in the sub-critical regime and in the quasi-critical regime introduced recently by Caravenna, Cottini and Rossi, arXiv:2307.02453v1. For $q\leq q_N$ with $q_N\to\infty$…

Probability · Mathematics 2025-03-24 Clément Cosco , Shuta Nakajima

We show that the hyperkahler geometry of $T^*\mathbb{CP}^{n-1}$ can be described algebraically by the affine scheme of rank-1 projections, and that this description simultaneously yields explicit $SU(n)$-equivariant isometric embeddings \[…

Algebraic Geometry · Mathematics 2026-03-27 Joshua Lackman

We introduce the following variant of the VC-dimension. Given $S \subseteq \{0, 1\}^n$ and a positive integer $d$, we define $\mathbb{U}_d(S)$ to be the size of the largest subset $I \subseteq [n]$ such that the projection of $S$ on every…

Computational Complexity · Computer Science 2022-06-28 Peter Frankl , Svyatoslav Gryaznov , Navid Talebanfard

There are several approaches to define an eigenvector decomposition of the finite Fourier Transform, which is in some sense unique, and at best resembles the eigenstates of the quantum harmonic oscillator. A solution given by Balian and…

Quantum Physics · Physics 2022-07-21 Gerhard Zauner

We introduce twisted matrix factorizations for quantum complete intersections of codimension two. For such an algebra, we show that in a given dimension, almost all the indecomposable modules with bounded minimal projective resolutions…

K-Theory and Homology · Mathematics 2017-10-23 Petter Andreas Bergh , Karin Erdmann

We consider frames in a finite-dimensional Hilbert space Hn where frames are exactly the spanning sets of the vector space. The diagram vector of a vector in R2 was previously defined using polar coordinates and was used to characterize…

Finite frames, or spanning sets for finite-dimensional Hilbert spaces, are a ubiquitous tool in signal processing. There has been much recent work on understanding the global structure of collections of finite frames with prescribed…

Functional Analysis · Mathematics 2023-09-14 Tom Needham , Clayton Shonkwiler

Packing a given sequence of items into as few bins as possible in an online fashion is a widely studied problem. We improve lower bounds for packing boxes into bins in two or more dimensions, both for general algorithms for squares and…

Data Structures and Algorithms · Computer Science 2017-11-07 David Blitz , Sandy Heydrich , Rob van Stee , André van Vliet , Gerhard J. Woeginger

Random field models have been widely employed to develop a predictor of an expensive function based on observations from an experiment. The traditional framework for developing a predictor with random field models can fail due to the…

Methodology · Statistics 2014-12-05 Matthew Plumlee

A weighted $t$-design in $\mathbb{R}^d$ is a finite weighted set that exactly integrates all polynomials of degree at most $t$ with respect to a given probability measure. A fundamental problem is to construct weighted $t$-designs with as…

Combinatorics · Mathematics 2025-05-20 Hiroshi Nozaki , Masanori Sawa

We study dimensions of sets projected to an $(n-2)$-dimensional family of hyperplanes in $\mathbb{R}^n$ under curvature conditions. Let $n\ge 3$ and $\Sigma \subset S^{n-1}$ be an $(n-2)$-dimensional $C^2$ manifold such that $\Sigma$ has…

Classical Analysis and ODEs · Mathematics 2026-04-20 Jiayin Liu

Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing $t$-designs. One of them is via group actions of certain permutation groups…

Combinatorics · Mathematics 2019-03-19 Cunsheng Ding , Chunming Tang

We formulate Vojta's conjecture for smooth weighted projective varieties, weighted multiplier ideal sheaves, and weighted log pairs and prove that all three versions of the conjecture are equivalent. In the process, we introduce generalized…

Algebraic Geometry · Mathematics 2025-11-19 Sajad Salami , Tony Shaska

The characterization of high-dimensional entanglement plays a crucial role in the field of quantum information science. Conventional entanglement criteria measuring coherent superpositions of multiple basis states face experimental…

Quantum Physics · Physics 2026-02-12 Jin-Min Liang , Shuheng Liu , Shao-Ming Fei , Qiongyi He

We introduce two families of criteria for detecting and quantifying the entanglement of a bipartite quantum state of arbitrary local dimension. The first is based on measurements in mutually unbiased bases and the second is based on…

Quantum Physics · Physics 2023-11-08 Simon Morelli , Marcus Huber , Armin Tavakoli

We try to embed a t-design in a finite commutative group in such a way that the sum of the k points of a block is zero. We can compute the number of blocks of the boolean 2-design having all the non zero vectors of $(Z_2)^n$ as the set of…

Combinatorics · Mathematics 2008-07-03 Andrea Caggegi , Alfonso Di Bartolo , Giovanni Falcone