English
Related papers

Related papers: Discrete tomography: Magic numbers for $N$-fold sy…

200 papers

This paper defines multidimensional sequential optimization numbers and prove that the unsigned Stirling numbers of first kind are 1-dimensional sequential optimization numbers. This paper gives a recurrence formula and an upper bound of…

Data Structures and Algorithms · Computer Science 2022-06-16 Zile Hui

We study several variants of the classical Sierpinski Carpet (SC) fractal. The main examples we call infinite magic carpets (IMC), obtained by taking an infinite blowup of a discrete graph approximation to SC and identifying edges using…

Analysis of PDEs · Mathematics 2019-02-12 Eric Goodman , Chun-Yin Siu , Robert S. Strichartz

We show that the Cappell-Shaneson version of Pick's theorem for simple lattice polytopes is a consequence of a general relation between characteristic numbers of virtual submanifolds dual to the characteristic classes of a stably almost…

Geometric Topology · Mathematics 2007-10-04 K. E. Feldman

In this article we show that given a Salem number $\lambda$, a totally real number field $k\subseteq\mathbb{Q}(\lambda+\lambda^{-1})$, and a positive integer $n\geq\mathrm{deg}_k(\lambda)-1$, there exist infinitely many commensurability…

Geometric Topology · Mathematics 2026-02-09 Michelle Chu , Plinio G. P. Murillo

For a finite set of non-zero natural numbers that contains at least one element different from 1 and the least common multiple of any of its subsets, there exists a subset of at least half of its members which has a common divisor larger…

Number Theory · Mathematics 2018-08-29 Tom Fischer

Let $\Lambda$ be a non-elementary convex co-compact fuchsian group which is a subgroup of an arithmetic fuchsian group. We prove that the Laplace operator of the hyperbolic surface $X=\Lambda \backslash\H$ has infinitely many resonances in…

Spectral Theory · Mathematics 2010-11-30 Dmitry Jakobson , Frédéric Naud

New Mersenne conjectures. The problems of simplicity, common prime divisors and free from squares of numbers $L(n) = 2^{2n}\pm2^n\pm1$ are investigated. Wonderful formulas $gcd $ for numbers $L (n) $ and numbers repunit are proved.

General Mathematics · Mathematics 2008-04-25 Boris V. Tarasov

We compute the volume of the convex N^2-1 dimensional set M_N of density matrices of size N with respect to the Hilbert-Schmidt measure. The hyper--area of the boundary of this set is also found and its ratio to the volume provides an…

Quantum Physics · Physics 2009-11-10 Karol Zyczkowski , Hans-Juergen Sommers

This is a computational study of bottlenecks on algebraic varieties. The bottlenecks of a smooth variety $X \subseteq \mathbb{C}^n$ are the lines in $\mathbb{C}^n$ which are normal to $X$ at two distinct points. The main result is a…

Algebraic Geometry · Mathematics 2018-04-30 David Eklund

We introduce matrix algebra of subsets in metric spaces and we apply it to improve results of Yamauchi and Davila regarding Asymptotic Property C. Here is a representative result: Suppose $X$ is an $\infty$-pseudo-metric space and $n\ge 0$…

Metric Geometry · Mathematics 2017-12-19 Jerzy Dydak

In this paper we discuss face numbers of generalised triangulations of manifolds in arbitrary dimensions. This is motivated by the study of triangulations of simply connected $4$-manifolds: We observe that, for a triangulation $\mathcal{T}$…

Geometric Topology · Mathematics 2024-01-23 Jonathan Spreer , Lucy Tobin

In 2020, Cameron et al. introduced the restricted numerical range of a digraph (directed graph) as a tool for characterizing digraphs and studying their algebraic connectivity. In particular, digraphs with a restricted numerical range of a…

Combinatorics · Mathematics 2021-06-03 Thomas R. Cameron , H. Tracy Hall , Ben Small , Alexander Wiedemann

Let $(M,g)$ be a compact manifold and let $-\Delta \phi_k = \lambda_k \phi_k$ be the sequence of Laplacian eigenfunctions. We present a curious new phenomenon which, so far, we only managed to understand in a few highly specialized cases:…

Spectral Theory · Mathematics 2017-06-06 Xiuyuan Cheng , Gal Mishne , Stefan Steinerberger

We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…

Combinatorics · Mathematics 2008-01-29 Joshua Cooper , Andrew Petrarca

We address the problem of one dimensional segment detection and estimation, in a regression setup. At each point of a fixed or random design, one observes whether that point belongs to the unknown segment or not, up to some additional…

Statistics Theory · Mathematics 2014-04-25 Victor-Emmanuel Brunel

The surgery unknotting number of a Legendrian link is defined as the minimal number of particular oriented surgeries that are required to convert the link into a Legendrian unknot. Lower bounds for the surgery unknotting number are given in…

Symplectic Geometry · Mathematics 2016-01-20 A. Bianca Boranda , Lisa Traynor , Shuning Yan

We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…

Combinatorics · Mathematics 2021-12-03 James East , Michael Hendriksen , Laurence Park

For an $(n-1)$-Auslander algebra $\Lambda$ with global dimension $n$, we give some necessary conditions for $\Lambda$ admitting a maximal $(n-1)$-orthogonal subcategory in terms of the properties of simple $\Lambda$-modules with projective…

Representation Theory · Mathematics 2009-03-05 Zhaoyong Huang , Xiaojin Zhang

For a set of distances $D$, a graph $G$ on $n$ vertices is said to be $D$-magic if there exists a bijection $f:V\rightarrow \{1,2, \ldots , n\}$ and a constant $k$ such that for any vertex $x$, $\sum_{y\in N_D(x)} f(y) = k$, where…

Combinatorics · Mathematics 2019-09-10 Rinovia Simanjuntak , Palton Anuwiksa

How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a notion of dispersion and connect it to asymptotic convex…

Computational Complexity · Computer Science 2008-06-17 Luis Rademacher , Santosh Vempala
‹ Prev 1 8 9 10 Next ›