English
Related papers

Related papers: Balanced Steinhaus triangles

200 papers

Orthogonal polynomials of several variables have a vector-valued three-term recurrence relation, much like the corresponding one-dimensional relation. This relation requires only knowledge of certain recurrence matrices, and allows simple…

Numerical Analysis · Mathematics 2022-02-17 Zexin Liu , Akil Narayan

When M is a finitely generated graded module over a standard graded algebra S and I is an ideal of S, it is known from work of Cutkosky, Herzog, Kodiyalam, R\"omer, Trung and Wang that the Castelnuovo-Mumford regularity of I^mM has the form…

Commutative Algebra · Mathematics 2010-12-07 David Eisenbud , Bernd Ulrich

The Collatz conjecture (or ``Syracuse problem'') considers recursively-defined sequences of positive integers where $n$ is succeeded by $\tfrac{n}{2}$, if $n$ is even, or $\tfrac{3n+1}{2}$, if $n$ is odd. The conjecture states that for all…

Number Theory · Mathematics 2023-04-05 Christian Hercher

Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…

Geometric Topology · Mathematics 2018-10-24 Benjamin A. Burton , Basudeb Datta , Nitin Singh , Jonathan Spreer

It was recently suggested that a solution to the separability problem for states that remain positive under partial transpose composed with realignment (the so-called symmetric with positive coefficients states or simply SPC states) could…

Quantum Physics · Physics 2024-02-09 Daniel Cariello

Given the collection of all $m\times n$ rectangular grids which have a fixed number $1\leq r\leq mn$ of blocked cells, we explicitly describe a proper subset of the collection which is guaranteed to contain at least one grid from each…

Combinatorics · Mathematics 2025-11-27 Noah Jensen , Stephanie Treneer

Let S be a set of n points in the plane, and let T be a set of m triangles with vertices in S. Then there exists a point in the plane contained in Omega(m^3 / (n^6 log^2 n)) triangles of T. Eppstein (1993) gave a proof of this claim, but…

Computational Geometry · Computer Science 2013-03-25 Gabriel Nivasch , Micha Sharir

For integers $d \geq 2$ and $\epsilon = 0$ or 1, let $S^{1, d - 1}(\epsilon)$ denote the sphere product $S^{1} \times S^{d - 1}$ if $\epsilon = 0$ and the twisted $S^{d - 1}$ bundle over $S^{1}$ if $\epsilon = 1$. The main results of this…

Geometric Topology · Mathematics 2007-10-02 Bhaskar Bagchi , Basudeb Datta

This paper investigates the dynamics of the iterated sum-of-divisors function $\sigma_k(m)$ and its behaviour modulo $m$, motivated by classical questions on perfect and multiperfect numbers and by the congruences $\sigma_k(m) \equiv 0…

General Mathematics · Mathematics 2025-12-30 Pedro Caceres , Zeraoulia Rafik

We show that a rectangle triangle random tiling with a tenfold symmetric phase is solvable by Bethe Ansatz. After the twelvefold square triangle and the eightfold rectangle triangle random tiling, this is the third example of a rectangle…

Statistical Mechanics · Physics 2011-11-29 Jan de Gier , Bernard Nienhuis

A variable line through the centroid G of a triangle divides the triangle into two parts each of whose lengths as a fraction of the perimeter fills a closed interval [m,1-m], with m between 0 and 1/2. We show that the range of m taken over…

Metric Geometry · Mathematics 2026-03-26 Allan Berele , Stefan Catoiu

In this article we construct uncountably many new homogeneous locally finite Steiner triple systems of countably infinite order as Fra\"{\i}ss\'{e} limits of classes of finite Steiner triple systems avoiding certain subsystems. The…

Combinatorics · Mathematics 2021-03-10 Daniel Horsley , Bridget S. Webb

A partial Steiner triple system of order $u$ is a pair $(U,\mathcal{A})$ where $U$ is a set of $u$ elements and $\mathcal{A}$ is a set of triples of elements of $U$ such that any two elements of $U$ occur together in at most one triple. If…

Combinatorics · Mathematics 2020-03-12 Darryn Bryant , Ajani De Vas Gunasekara , Daniel Horsley

We explicitly write down the Eisenstein elements inside the space of modular symbols for Eisenstein series with integer coefficients for the congruence subgroups $\Gamma_0(N)$ with $N$ odd square-free. We also compute the winding elements…

Number Theory · Mathematics 2022-08-09 Srilakshmi Krishnamoorthy

We prove that every $n$ vertex linear triple system with $m$ edges has at least $m^6/n^7$ copies of a pentagon, provided $m>100 \, n^{3/2}$. This provides the first nontrivial bound for a question posed by Jiang and Yepremyan. More…

Combinatorics · Mathematics 2025-02-18 Dhruv Mubayi , Jozsef Solymosi

In the paper defines a boundary of stability zone for sigma-delta modulator. The boundary depends from inner sigma-delta modulator coefficients. For designing purposes such result could be used to find or compare some appropriate schemes…

Other Computer Science · Computer Science 2013-06-18 Evgenii Khokhryakov

Given a complete Riemannian manifold $\mathcal{M}\subset\mathbb{R}^d$ which is a Lipschitz neighbourhood retract of dimension $m+n$, of class $C^{h,\beta}$ and an oriented, closed submanifold $\Gamma \subset \mathcal M$ of dimension $m-1$,…

Analysis of PDEs · Mathematics 2023-08-21 Gianmarco Caldini , Andrea Marchese , Andrea Merlo , Simone Steinbrüchel

The ternary Goldbach conjecture states that every odd number $m \geqslant 7$ can be written as the sum of three primes. We construct a set of primes $\mathbb{P}$ defined by an expanding system of admissible congruences such that almost all…

Number Theory · Mathematics 2024-09-16 Debmalya Basak , Raghavendra N. Bhat , Anji Dong , Alexandru Zaharescu

We count tilings of the $n \times m$ rectangular grid, cylinder, and torus with arbitrary tile sets up to arbitrary symmetries of the square and rectangle, along with cyclic shifting of rows and columns. This provides a unifying framework…

Combinatorics · Mathematics 2025-09-30 Peter Kagey , William Keehn

We say that a diagonal in an array is {\em $\lambda$-balanced} if each entry occurs $\lambda$ times. Let $L$ be a frequency square of type $F(n;\lambda^m)$; that is, an $n\times n$ array in which each entry from $\{1,2,\dots ,m\}$ occurs…

Combinatorics · Mathematics 2018-02-06 Nicholas Cavenagh , Adam Mammoliti