English
Related papers

Related papers: Notes on higher-dimensional tarai functions

200 papers

For each $d\geq 3$ we construct cube complexes homeomorphic to the $d$-sphere with $n$ vertices in which the number of facets (assuming $d$ constant) is $\Omega(n^{5/4})$. This disproves a conjecture of Kalai's stating that the number of…

Combinatorics · Mathematics 2025-03-25 Sergey Avvakumov , Alfredo Hubard

We show that the class of twisted fractionally Calabi-Yau algebras of finite global dimension coincides with the stable endomorphism algebras of $d$-cluster tilting modules over $d$-representation-finite algebras. This is an application of…

Representation Theory · Mathematics 2026-04-22 Aaron Chan , Osamu Iyama , Rene Marczinzik

A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum number of edges that a thrackle of n vertices can have.…

Combinatorics · Mathematics 2010-02-23 Radoslav Fulek , Janos Pach

Let $M^{(k)}_{d}(n)$ be the manifold of $n$-tuples $(x_1,\ldots,x_n)\in(\mathbb{R}^d)^n$ having non-$k$-equal coordinates. We show that, for $d\geq2$, $M^{(3)}_{d}(n)$ is rationally formal if and only if $n\leq 6$. This stands in sharp…

Algebraic Topology · Mathematics 2026-04-22 Jesús González , José Luis León-Medina

As a result of 33 intercontinental Zoom calls, we characterise big Ramsey degrees of the generic partial order. This is an infinitary extension of the well known fact that finite partial orders endowed with linear extensions form a Ramsey…

We prove that three-dimensional $N=1$ supersymmetric Yang-Mills-Chern-Simons theory is finite to all loop orders. In general this leaves open the possibility that different regularization methods lead to different finite effective actions.…

High Energy Physics - Theory · Physics 2009-10-30 F. Ruiz Ruiz , P. van Nieuwenhuizen

Let A and B be two finite sets of points with total cardinality n, the many to many point matching with demands and capacities matches each point ai in A to at least alpha'i and at most alphai points in B, and each point bj in B to at least…

Data Structures and Algorithms · Computer Science 2013-01-16 Fatemeh Rajabi-Alni , Alireza Bagheri

We consider a class of $n^{\text{th}}$-order linear ordinary differential equations with a large parameter $u$. Analytic solutions of these equations can be described by (divergent) formal series in descending powers of $u$. We demonstrate…

Classical Analysis and ODEs · Mathematics 2024-09-30 Gergő Nemes

We prove an average-case depth hierarchy theorem for Boolean circuits over the standard basis of $\mathsf{AND}$, $\mathsf{OR}$, and $\mathsf{NOT}$ gates. Our hierarchy theorem says that for every $d \geq 2$, there is an explicit…

Computational Complexity · Computer Science 2015-04-15 Benjamin Rossman , Rocco A. Servedio , Li-Yang Tan

We know that tilesets that can tile the plane always admit a quasi-periodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicity function is one way to measure the regularity of a quasi-periodic…

Cellular Automata and Lattice Gases · Physics 2010-12-07 Alexis Ballier , Emmanuel Jeandel

We classify newforms with rational Fourier coefficients and complex multiplication for fixed weight up to twisting. Under the extended Riemann hypothesis for odd real Dirichlet characters, these newforms are finite in number. We produce…

Number Theory · Mathematics 2008-10-02 Matthias Schuett

We develop some basic results in a higher dimensional foliated Mori theory, and show how these results can be used to prove a structure theorem for the Kleiman-Mori cone of curves in terms of the numerical properties of $K_{\mathcal{F}}$…

Algebraic Geometry · Mathematics 2019-11-20 Calum Spicer

In the degree-diameter problem for Abelian Cayley and circulant graphs of diameter 2 and arbitrary degree d there is a wide gap between the best lower and upper bounds valid for all d, being quadratic functions with leading coefficient 1/4…

Combinatorics · Mathematics 2015-06-10 Robert R. Lewis

In this paper, we extend Busy Beaver function to a class of higher order Busy Beaver functions based on Turing oracle machine. We prove some results about the relation between decidability of number theoretical formula and higher order Busy…

Computational Complexity · Computer Science 2025-07-30 Zining Cao

We use Fourier methods to prove that if $n > 1$ translates of sublattices of $Z^d$ tile $Z^d$, and all the sublattices are Cartesian products of arithmetic progressions, then two of the tiles must be translates of each other. This is a…

Combinatorics · Mathematics 2010-06-04 David Feldman , James Propp , Sinai Robins

Closed classes of three-valued logic generated by symmetric funtions that equal $1$ in almost all tuples from $\{1,2\}^n$ and equal $0$ on the rest tuples are considered. Criteria for bases existence for these classes is obtained.

Logic · Mathematics 2015-04-15 Anna Mikhailovich

A Riemannian manifold is a called a good rational expander in dimension $i$ if every $i$-cycle bounds a rational $i+1$-chain of comparatively small volume. We construct 3-manifolds which are good expanders in all dimensions. On the other…

Geometric Topology · Mathematics 2024-05-09 Jonathan Zung

We provide an affirmative answer to the Cr Closing Lemma, r>1, for a large class of flows defined on every closed surface.

Dynamical Systems · Mathematics 2007-08-07 Carlos Gutierrez , Benito Pires

For the real number $\alpha>1$, we use a technique due to Nehari and Netanyahu and an application of certain integral iteration of Caratheodory functions to find the best-possible upper bounds on the coefficients of functions of the class…

Complex Variables · Mathematics 2009-11-04 K. O. Babalola

For $n>3$, every $n\times n$ partial Cayley matrix with at most $n-1$ holes can be reconstructed by quadrangle criterion. Moreover, the holes can be filled in given order. Without additional assumptions, this is the best possible result.…

Group Theory · Mathematics 2007-05-23 Petr Vojtěchovský