相关论文: Coronoids, Patches and Generalised Altans

We give an elementary construction of polyhedra whose links are connected bipartite graphs, which are not necessarily isomorphic pairwise. We show, that the fundamental groups of some of our polyhedra contain surface groups. In particular,…

We develop an alternative view on the concept of connections over a vector bundle map, which consists of a horizontal lift procedure to a prolonged bundle. We further focus on prolongations to an affine bundle and introduce the concept of…

Generalised polynomials are maps constructed by applying the floor function, addition, and multiplication to polynomials. Despite superficial similarity, generalised polynomials exhibit many phenomena which are impossible for polynomials.…

Cartan geometry provides a unifying algebraic construction of curvature and torsion, based on an underlying model Lie algebra -- a viewpoint that can be extended naturally to the higher algebraic structures underlying supergravity. We…

We compare two known methods of extending a complex, unital, commutative normed algebra so as to include solutions to sets of monic polynomials over the original algebra. (One of these is a generalisation of a construction from the thesis…

In recent work N. Hitchin introduced the concept of "generalised geometry". The key feature of generalised structures is that that they can be acted on by both diffeomorphisms and 2-forms, the so-called $B$-fields. In this lecture, we give…

A generalized quadrangle is a point-line incidence geometry such that any two points lie on at most one line and, given a line $\ell$ and a point $P$ not incident with $\ell$, there is a unique point of $\ell$ collinear with $P$. We study…

Although every exactly known bond percolation critical threshold is the root in $[0,1]$ of a lattice-dependent polynomial, it has recently been shown that the notion of a critical polynomial can be extended to any periodic lattice. The…

We generalize the inverse patchy colloid model that was originally developed for heterogeneously charged particles with two identical polar patches and an oppositely charged equator to a model that can have a considerably richer surface…

The central discovery of $2d$ conformal theory was holomorphic factorization, which expressed correlation functions through bilinear combinations of conformal blocks, which are easily cut and joined without a need to sum over the entire…

A grid polygon is a polygon whose vertices are points of a grid. We define an injective map between permutations of length n and a subset of grid polygons on n vertices, which we call consecutive-minima polygons. By the kernel method, we…

Unifying various constructions of quandles including Coxeter quandles, free quandles, knot quandles of prime knots and Dehn quandles of orientable surfaces, we introduce Dehn quandles of groups with respect to their subsets. It turns out…

A new class of non-linear O(3) models is introduced. It is shown that these systems lead to integrable submodels if an additional integrability condition (so called the generalized eikonal equation) is imposed. In the case of particular…

We show that planar embeddable 3-connected CAD graphs are generically non-soluble. A CAD graph represents a configuration of points on the Euclidean plane with just enough distance dimensions between them to ensure rigidity. Formally, a CAD…

We introduce the shuffle of deformed permutahedra (a.k.a. generalized permutahedra), a simple associative operation obtained as the Cartesian product followed by the Minkowski sum with the graphical zonotope of a complete bipartite graph.…

The purpose of this paper is to present a generalized hole argument for gauge field theories and their geometrical setting in terms of fiber bundles. The generalized hole argument is motivated and extended from the spacetime hole arguments…

In this paper, we introduce a generalization of corona of graphs. This construction generalizes the generalized corona of graphs (consequently, the corona of graphs), the cluster of graphs, the corona-vertex subdivision graph of graphs and…

In a highly influential paper, Bidigare, Hanlon and Rockmore showed that a number of popular Markov chains are random walks on the faces of a hyperplane arrangement. Their analysis of these Markov chains took advantage of the monoid…

We introduce the notion of a combinatorial $n$-od cover, for $n \geq 3$, which is a tool that may be used to show that certain continua embedded in the plane are not simple $n$-od-like. Using this tool, we generalize a classic example of…

In this paper we consider all possible generalizations of the B-type Hecke algebras, namely the cyclotomic and what we call 'generalized', and we construct Markov traces on each of them, so as to obtain all possible different levels of…