相关论文: The first omega alephs: from simplices to trees of…

We study high order random walks in high dimensional expanders; namely, in complexes which are local spectral expanders. Recent works have studied the spectrum of high order walks and deduced fast mixing. However, the spectral gap of high…

In 2003, Cohn and Umans described a framework for proving upper bounds on the exponent $\omega$ of matrix multiplication by reducing matrix multiplication to group algebra multiplication, and in 2005 Cohn, Kleinberg, Szegedy, and Umans…

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

We prove that in the Cohen extension adding $\aleph_3$ generic reals to a model of $ZFC+CH$ containing a simplified $(\omega_1,2)$-morass, gap-2 morass-definable $\eta_1$-orderings with cardinality $\aleph_3$ are order-isomorphic. Hence it…

A caterpillar tree is a connected, acyclic, graph in which all vertices are either a member of a central path, or joined to that central path by a single edge. In other words, caterpillar trees are the class of trees which become path…

We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…

We compute the structure constants of topological symmetric orbifold theories up to third order in the large N expansion. The leading order structure constants are dominated by topological metric contractions. The first order interactions…

This is the second in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. The first…

We investigate, in ZFC, the behavior of abstract elementary classes (AECs) categorical in many successive small cardinals. We prove for example that a universal $\mathbb{L}_{\omega_1, \omega}$ sentence categorical on an end segment of…

We prove that if an $n$-vertex graph with minimum degree at least $3$ contains a Hamiltonian cycle, then it contains another cycle of length $n-o(n)$; this implies, in particular, that a well-known conjecture of Sheehan from 1975 holds…

We prove the following two results. Theorem A: Let alpha be a limit ordinal. Suppose that 2^{|alpha|}<aleph_alpha and 2^{|alpha|^+}<aleph_{|alpha|^+}, whereas aleph_alpha^{|alpha|}>aleph_{|alpha|^+}. Then for all n< omega and for all…

Inspired by the work of Ellenberg, Elsholtz, Hall, and Kowalski, we investigate how the property of the generic fiber of a one-parameter family of abelian varieties being geometrically simple extends to other fibers. In \cite{EEHK09}, the…

This paper is a first step toward the full description of a family of Hopf algebras whose coradical is isomorphic to a semisimple Hopf algebra K_{n}, n an odd positive integer, obtained by a cocentral abelian cleft extension. We describe…

We study tree-to-tree transformations that can be defined in first-order logic or monadic second-order logic. We prove a decomposition theorem, which shows that every transformation can be obtained from prime transformations, such as…

The classical matrix-tree theorem was discovered by G.~Kirchhoff in 1847. It relates the principal minor of the Laplace (nxn)-matrix to a particular sum of monomials indexed by the set of trees with n vertices. The aim of this paper is to…

Using the Polya Enumeration Theorem, we count with particular attention to C^3/Gamma up to C^6/Gamma, abelian orbifolds in various dimensions which are invariant under cycles of the permutation group S_D. This produces a collection of…

In the eighties, A. Connes and E. J. Woods made a connection between hyperfinite von Neumann algebras and Poisson boundaries of time dependent random walks. The present paper explains this connection and gives a detailed proof of two…

The circular coordinates algorithm, a key tool in topological data analysis, relies on a theoretically unvalidated lifting step to convert cocycles from a prime field to integer coefficients. We provide a rigorous analysis of this…

For a simplicial complex X on {1,2, ..., n} we define enriched homology and cohomology modules. They are graded modules over k[x_1, ..., x_n] whose ranks are equal to the dimensions of the reduced homology and cohomology groups. We…

Such large-structure tools of cohomology as toposes and derived categories stay close to arithmetic in practice, yet existing foundations for them go beyond the strong set theory ZFC. We formalize the practical insight by founding the…