Related papers: A Continuous Analogue for Young Diagrams

We explore the combinatorial properties of the branching areas of execution paths in higher dimensional automata. Mathematically, this means that we investigate the combinatorics of the negative corner (or branching) homology of a globular…

The special geometry of calibrated cycles, closely related to mirror symmetry among Calabi--Yau 3-folds, is itself a real form of a new subject, which we call slightly deformed algebraic geometry. On the other hand, both of these geometries…

A central challenge in topological data analysis is the interpretation of barcodes. The classical algebraic-topological approach to interpreting homology classes is to build maps to spaces whose homology carries semantics we understand and…

In this note, we outline the general development of a theory of symmetric homology of algebras, an analog of cyclic homology where the cyclic groups are replaced by symmetric groups. This theory is developed using the framework of crossed…

A particular case of a causal set is considered that is a directed dyadic acyclic graph. This is a model of a discrete pregeometry on a microscopic scale. The dynamics is a stochastic sequential growth of the graph. New vertexes of the…

The aim of these notes is to provide a reasonably short and "hands-on" introduction to the differential calculus on associative algebras over a field of characteristic zero. Following a suggestion of Ginzburg's we call the resulting theory…

Learning the underlying Bayesian Networks (BNs), represented by directed acyclic graphs (DAGs), of the concerned events from purely-observational data is a crucial part of evidential reasoning. This task remains challenging due to the large…

The motion of an incompressible fluid in Lagrangian coordinates involves infinitely many symmetries generated by the left Lie algebra of group of volume preserving diffeomorphisms of the three dimensional domain occupied by the fluid.…

Based on a novel discretization procedure which has recently been proposed and applied in the construction of a canonical discrete analogue of confocal coordinate systems, an explicit method of constructing discrete analogues of ellipsoids…

Many interesting examples of operator algebras, both self-adjoint and non-self-adjoint, can be constructed from directed graphs. In this survey, we overview the construction of $C^*$-algebras from directed graphs and from two…

Let A be a C*-algebra and d from A into A** be a continuous linear map. We assume that d acts like derivation or anti-derivation at orthogonal elements for several types of orthogonality conditions such as ab=0, ab*=0, ab=ba=0 and…

We study several natural classes of graphs on a zero-dimensional metrizable compact space having no continuous coloring. We compare these graphs with the quasi-order associated with injective continuous homomorphisms. We prove the existence…

Graphons are analytic objects associated with convergent sequences of graphs. Problems from extremal combinatorics and theoretical computer science led to a study of graphons determined by finitely many subgraph densities, which are…

In this paper we give a construction for a linear quotient ordering of a class of products of two ideals which have linear quotients. We apply this construction to give a class of modified anticycle graphs whose square and cube have linear…

For any polynomial representation of the special linear group, the nodes of the corresponding crystal may be indexed by semi-standard Young tableaux. Under certain conditions, the standard Young tableaux occur, and do so with weight 0.…

We construct a universal phantom subcategory on the blow-up of the complex projective plane in 11 general points. This phantom subcategory is the orthogonal complement of a non-full exceptional collection of line bundles of maximal length.…

For Pontryagin's group duality in the setting of locally compact topological Abelian groups, the topology on the character group is the compact open topology. There exist at present two extensions of this theory to topological groups which…

In this paper we consider planar polygons with parallel opposite sides. This type of polygons can be regarded as discretizations of closed convex planar curves by taking tangent lines at samples with pairwise parallel tangents. For this…

A combinatorial Gray code for a class of objects is a listing that contains each object from the class exactly once such that any two consecutive objects in the list differ only by a `small change'. Such listings are known for many…

Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…