相关论文: Constructing Goeritz matrix from Dehn coloring mat…

A systematic construction of the Green's matrix for a second order, self-adjoint matrix differential operator from the linearly independent solutions of the corresponding homogeneous differential equation set is carried out. We follow the…

We prove that for any point set P in the plane, a triangle T, and a positive integer k, there exists a coloring of P with k colors such that any homothetic copy of T containing at least ck^8 points of P, for some constant c, contains at…

Proposing an effective and flexible matrix to represent a graph is a fundamental challenge that has been explored from multiple perspectives, e.g., filtering in Graph Fourier Transforms. In this work, we develop a novel and general…

We give asymptotically optimal constructions in generalized Ramsey theory using results about conflict-free hypergraph matchings. For example, we present an edge-coloring of $K_{n,n}$ with $2n/3 + o(n)$ colors such that each $4$-cycle…

It is shown that a covariant derivative on any d-dimensional manifold M can be mapped to a set of d operators acting on the space of functions on the principal Spin(d)-bundle over M. In other words, any d-dimensional manifold can be…

Connections between structural graph theory and finite model theory recently gained a lot of attention. In this setting, many interesting questions remain on the properties of dependent (NIP) hereditary classes of graphs, in particular…

A \emph{geometric graph} is a graph whose vertex set is a set of points in general position in the plane, and its edges are straight line segments joining these points. We show that for every integer $k \ge 2$, there exists a constat $c>0$…

In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list-critical graphs occupy a prominent place in graph coloring theory. Stiebitz, Tuza, and…

We introduce coloring groups, which are permutation groups obtained from a proper edge coloring of a graph. These groups generalize the generalized toggle groups of Striker (which themselves generalize the toggle groups introduced by…

A matrix factorization problem is considered. The matrix to be factorized is algebraic, has dimension 2 X 2 and belongs to Moiseev's class. A new method of factorization is proposed. First, the matrix factorization problem is reduced to a…

In the article we discuss the notion of the generalized invariant manifold introduced in our previous study. In the literature the method of the differential constraints is well known as a tool for constructing particular solutions for the…

A persistent lamination for a knot K is an essential lamination in the complement of K, which remains essential after every non-trivial Dehn surgery along K. Having a persistent lamination implies, for example, that every manifold obtained…

We introduce a family of polynomials, which arise in three distinct ways: in the large $N$ expansion of a matrix integral, as a weighted enumeration of factorisations of permutations, and via the topological recursion. More explicitly, we…

The centralizer algebra of a matrix consists of those matrices that commute with it. We investigate the basic representation-theoretic invariants of centralizer algebras, namely their radicals, projective indecomposable modules, injective…

A G-coloured knot is a knot together with a representation of its knot group onto G. Two G-coloured knots are said to be rho-equivalent if they are related by surgery around unit framed unknots in the kernels of their colourings. The…

We propose an algorithm to reduce a k-chromatic graph to a complete graph of largest possible order through a well defined sequence of contractions. We introduce a new matrix called transparency matrix and state its properties. We then…

Configuration space integrals are powerful tools for studying the homotopy type of the space of long embeddings in terms of a combinatorial object called a graph complex. It is unknown whether these integrals give a cochain map due to…

In the List $k$-Coloring problem we are given a graph whose every vertex is equipped with a list, which is a subset of $\{1,\ldots,k\}$. We need to decide if $G$ admits a proper coloring, where every vertex receives a color from its list.…

We prove several results about the complexity of the role colouring problem. A role colouring of a graph $G$ is an assignment of colours to the vertices of $G$ such that two vertices of the same colour have identical sets of colours in…

A generalized torsion element is a non-trivial element such that some non-empty finite product of its conjugates is the identity. We construct a generalized torsion element of the fundamental group of a 3-manifold obtained by Dehn surgery…