Related papers: Complex Cellular Structures

Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…

In the early 1990s, Kapranov and Voevodsky proposed a geometric method for constructing higher-categorical pasting diagrams from generically framed convex polytopes. This work revisits their construction and identifies a convex-geometric…

In the present paper we investigate a new class of infinite-dimensional modules over the hyperalgebra of a semi-simple algebraic group in positive chararacteristic called quasi-Verma modules. We provide a purely algebraic construction of…

We describe complex conjugation on the primitive middle-dimensional algebraic de Rham cohomology of a smooth projective hypersurface defined over a number field that admits a real embedding. We use Griffiths' description of the cohomology…

We study a finite-dimensional quotient of the Hecke algebra of type $H_n$ for general $n$, using a calculus of diagrams. This provides a basis of monomials in a certain set of generators. Using this, we prove a conjecture of C.K. Fan about…

The classification of real Clifford algebras in terms of matrix algebras is well--known. Here we consider the real Clifford algebra ${\mathcal Cl}(r,s)$ not as a matrix algebra, but as a Clifford module over itself. We show that ${\mathcal…

A two-dimensional topological sigma-model on a generalized Calabi-Yau target space $X$ is defined. The model is constructed in Batalin-Vilkovisky formalism using only a generalized complex structure $J$ and a pure spinor $\rho$ on $X$. In…

We study the problem of computing the homology of the configuration spaces of a finite cell complex $X$. We proceed by viewing $X$, together with its subdivisions, as a subdivisional space--a kind of diagram object in a category of cell…

We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…

In this paper the authors prove fundamental decomposition theorems pertaining to the internal structure of monoidal triangulated categories (M$\Delta$Cs). The tensor structure of an M$\Delta$C enables one to view these categories like…

Using a result of Vdovina, we may associate to each complete connected bipartite graph $\kappa$ a $2$-dimensional square complex, which we call a tile complex, whose link at each vertex is $\kappa$. We regard the tile complex in two…

Graph-based signal processing techniques have become essential for handling data in non-Euclidean spaces. However, there is a growing awareness that these graph models might need to be expanded into `higher-order' domains to effectively…

We construct relative Gromov--Witten theory with expanded degenerations in the normal crossings setting and establish a degeneration formula for the resulting invariants. Given a simple normal crossings pair $(X,D)$, we show that there…

We introduce a path-theoretic framework for understanding the representation theory of (quantum) symmetric and general linear groups and their higher level generalisations over fields of arbitrary characteristic. Our first main result is a…

Let $V$ be a finite dimensional complex vector space and $W\subset \GL(V)$ be a finite complex reflection group. Let $V^{\reg}$ be the complement in $V$ of the reflecting hyperplanes. A classical conjecture predicts that $V^{\reg}$ is a…

We develop a real-analytic framework, called perplex analysis, in which the complex, split-complex, and dual numbers arise as members of a single four-parameter family of two-dimensional commutative real algebras. Within this unified…

Using the representation theory of Cherednik algebras at $t=0$ and a Galois covering of the Calogero-Moser space, we define the notions of left, right and two-sided Calogero-Moser cells for any finite complex reflection group. To each…

We characterize completey (give a necessary and suffcient condition using special neat embeddings)for a relation algebra to belong to the amalgamation, strong amalgamation, and superamalgamation base of the class of representable algebras.…

We revisit Kapranov and Voevodsky's idea of spaces modelled on combinatorial pasting diagrams, now as a framework for higher-dimensional rewriting and the basis of a model of weak omega-categories. In the first part, we elaborate on…

In this paper, we revisit the problem of classifying real algebraic and semialgebraic sets by their topological types, focusing on establishing the effectiveness of bounds rather than deriving new quantitative estimates. Building on Hardt's…