相关论文: Polycyclic Geometric Realizations of the Gray Conf…

We consider the problem of translating between irreducible closed sets and implicational bases in closure systems. To date, the complexity status of this problem is widely open, and it is further known to generalize the notorious hypergraph…

This thesis deals with the phase space realization of asymptotic higher spin symmetries, in 4d asymptotically flat spacetimes. In the gravitational case for instance, these symmetries generalize the BMS algebra to include an infinite tower…

We provide a complete classification of possible configurations of mutually pairwise touching infinite cylinders in Euclidian 3D space. It turns out that there is a maximum number of such cylinders possible in 3D independently on the shape…

Let W be a planar 3-web defined on a neighborhood of a point M. We call "symmetry of W around M" any local diffeomorphism which fixes M and maps each foliation of W to a (not necessarily the same) foliation of W. We say that it is a simple…

Mirror graphs were introduced by Bre\v{s}ar et al. in 2004 as an intriguing class of graphs: vertex-transitive, isometrically embeddable into hypercubes, having a strong connection with regular maps and polytope structure. In this article…

We determine the possible finite groups $G$ of symplectic automorphisms of hyperk\"ahler manifolds which are deformation equivalent to the second Hilbert scheme of a K3 surface. We prove that $G$ has such an action if, and only if, it is…

We study minimal harmonic maps $g: {\mathbb{C}} \to SO(3) \backslash SL(3,{\mathbb{R}})$, parameterized by polynomial cubic differentials $P$ in the plane. The asymptotic structure of such a $g$ is determined by a convex polygon $Y(P)$ in…

In this paper, we determine the computational complexity of recognizing two graph classes, \emph{grounded L}-graphs and \emph{stabbable grid intersection} graphs. An L-shape is made by joining the bottom end-point of a vertical ($\vert$)…

We resolve the `baxterization' problem with the help of the automorphism group of the Yang-Baxter (resp. star-triangle, tetrahedron, \dots) equations. This infinite group of symmetries is realized as a non-linear (birational) Coxeter group…

We reveal an intriguing connection between the set of 27 (disregarding the identity) invertible symmetric 3 x 3 matrices over GF(2) and the points of the generalized quadrangle GQ(2,4). The 15 matrices with eigenvalue one correspond to a…

In this note we consider two simplicial arrangements of lines and ideals $I$ of intersection points of these lines. There are $127$ intersection points in both cases and the numbers $t_i$ of points lying on exactly $i$ configuration lines…

Let E/F be a quadratic number (resp. p-adic) field extension, and F' an odd degree cyclic field extension of F. We establish a base-change functorial lifting of automorphic (resp. admissible) representations from the unitary group U(3,E/F)…

An automorphism of a graph is called quasi-semiregular if it fixes a unique vertex of the graph and its remaining cycles have the same length. This kind of symmetry of graphs was first investigated by Kutnar, Malni\v{c}, Mart\'{i}nez and…

We show that groups presented by inverse-closed finite convergent length-reducing rewriting systems are characterised by a striking geometric property: their Cayley graphs are geodetic and side-lengths of non-degenerate triangles are…

A calligraph is a graph that for almost all edge length assignments moves with one degree of freedom in the plane, if we fix an edge and consider the vertices as revolute joints. The trajectory of a distinguished vertex of the calligraph is…

We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…

In this work we compute the Dixmier invariants and bitangents of the plane quartics with 3,6 or 9-cyclic automorphisms, we find that a quartic curve with 6-cyclic automorphism will have 3 horizontal bitangents which form an asysgetic…

Circular coloring is a constraints satisfaction problem where colors are assigned to nodes in a graph in such a way that every pair of connected nodes has two consecutive colors (the first color being consecutive to the last). We study…

We call a set of points $Z\subset{\mathbb P}^{3}_{\mathbb C}$ an $(a,b)$-geproci set (for GEneral PROjection is a Complete Intersection) if its projection from a general point $P$ to a plane is a complete intersection of curves of degrees…

Classical gravitating field theories reduced to three dimensions admit manifest gauge invariances and hidden symmetries, which together make up the invariance group G of the theory. If this group is large enough, the target space is a…