相关论文: Polycyclic Geometric Realizations of the Gray Conf…
We develop a theory for the existence of perfect matchings in hypergraphs under quite general conditions. Informally speaking, the obstructions to perfect matchings are geometric, and are of two distinct types: 'space barriers' from convex…
A matching is a set of edges in a graph with no common endpoint. A matching M is called acyclic if the induced subgraph on the endpoints of the edges in M is acyclic. Given a graph G and an integer k, Acyclic Matching Problem seeks for an…
Deciding realizability of a given polyhedral map on a (compact, connected) surface belongs to the hard problems in discrete geometry, from the theoretical, the algorithmic, and the practical point of view. In this paper, we present a…
A triality is a sort of super-symmetry that exchanges the types of the elements of an incidence geometry in cycles of length three. Although geometries with trialities exhibit fascinating behaviors, their construction is challenging, making…
Let ${\mathcal A}$ be a finite real linear hyperplane arrangement in three dimensions. Suppose further that all the regions of ${\mathcal A}$ are isometric. We prove that ${\mathcal A}$ is necessarily a Coxeter arrangement. As it is well…
We analyze a three-dimensional discontinuous piecewise linear system \(Z=(X,Y)\) whose switching manifold \(\Sigma\) contains visible-visible two-fold intersection lines. Assuming that the matrices \(DX\) and \(DY\) each have one nonzero…
Gauge theories are important descriptions for many physical phenomena and systems in quantum computation. Automorphism of gauge group naturally gives global symmetries of gauge theories. In this work we study such symmetries in gauge…
We investigate the relationship between finite groups and incidence geometries through their automorphism structures. Building upon classical results on the realizability of groups as automorphism groups of graphs, we develop a general…
Felix Klein in course of his study of the regular icosahedron and its symmetries encountered a highly symmetric configuration of $60$ points in ${\mathbb P}^3$. This configuration has appeared in various guises, perhaps post notably as the…
We make some general remarks on long-ranged configurations in gauge or diffeomorphism invariant theories where the fields are allowed to assume some non vanishing values at spatial infinity. In this case the Gauss constraint only eliminates…
Let $\mathrm{Mod}(S_g)$ denote the mapping class group of the closed orientable surface $S_g$ of genus $g\geq 2$. Given a finite subgroup $H$ of $\mathrm{Mod}(S_g)$, let $\mathrm{Fix}(H)$ denote the set of fixed points induced by the action…
Without imposing restrictions on a weighted graph's arc lengths, symmetry structures cannot be expected. But, they exist. To find them, the graphs are decomposed into a component that dictates all closed path properties (e.g., shortest and…
We study rank-three matroids, known as point-line configurations, and their associated matroid varieties, defined as the Zariski closures of their realization spaces. Our focus is on determining finite generating sets of defining equations…
Let $X=(V,E)$ be a finite simple connected graph with $n$ vertices and $m$ edges. A configuration is an assignment of one of two colors, black or white, to each edge of $X.$ A move applied to a configuration is to select a black edge…
We show that if $X$ is an indecomposable $PD_3$-complex and $\pi_1(X) is the fundamental group of a reduced finite graph of finite groups but is not virtually cyclic then $X$ is orientable, the underlying graph is a tree, all the edge…
The geometric realizations of Lusztig's symmetries of symmetrizable quantum groups are given in this paper. This construction is a generalization of that in [19].
The geometric and algebraic properties of Gray categories with duals are investigated by means of a diagrammatic calculus. The diagrams are three-dimensional stratifications of a cube, with regions, surfaces, lines and vertices labelled by…
Two mappings in a finite field, the Frobenius mapping and the cyclic shift mapping, are applied on lines in PG($n,p$) or codes in the Grassmannian, to form automorphisms groups in the Grassmanian and in its codes. These automorphisms are…
We introduce the Multicolored Graph Realization problem (MGRP). The input to the problem is a colored graph $(G,\varphi)$, i.e., a graph together with a coloring on its vertices. We can associate to each colored graph a cluster graph…
In this note we study curves (arrangements) in the complex projective plane which can be considered as generalizations of free curves. We construct families of arrangements which are nearly free and possess interesting geometric properties.…