相关论文: Twin bent functions and Clifford algebras

We extend constructions of classical Clifford analysis to the case of indefinite non-degenerate quadratic forms. We define (p,q)-left- and right-monogenic functions by means of Dirac operators that factor a certain wave operator. We prove…

In this paper we shall give sufficient conditions for local CR diffeomorphisms between two real analytic submanifolds of $\Bbb C^N$ to be determined by finitely many derivatives at finitely many points. These conditions will also be shown…

We show that the set of Hilbert functions $P(m)=\chi(mK_\mathcal{F})$ of 2-dimensional foliated canonical models with fixed $K_\mathcal{F}^2$, $K_\mathcal{F} \cdot K_X$ and $i_\mathbb{Q}(\mathcal{F})$ is finite. As a consequence, we deduce…

The $H$-Coloring problem is a well-known generalization of the classical NP-complete problem $k$-Coloring where the task is to determine whether an input graph admits a homomorphism to the template graph $H$. This problem has been the…

We expand on some invariants used for classifying nonselfadjoint operator algebras. Specifically to nonselfadjoint operator algebras which have a conditional expectation onto a commutative diagonal we construct an edge-colored directed…

Let $A$ be one of the following Clifford algebras : $\mathbb{R}_2 \cong \mathbb{H}$ or $\mathbb{R}_3$. For the algebra $A$, the automorphism group $Aut(A)$ and its invariants are well known. In this paper we will describe the invariants of…

Using a binary representation for basis elements of an algebra combined with a framework of multiplier and index functions, a connection has been established between the structure of a large class of algebras and the XOR componentwise…

In this article we determine the structure of a twisted first cohomology group of the first homology of a trivalent graph with a coefficient associated with the quantum Clebsch-Gordan condition. As an application we give a characterization…

An assignment of colours to the vertices of a graph is stable if any two vertices of the same colour have identically coloured neighbourhoods. The goal of colour refinement is to find a stable colouring that uses a minimum number of…

Let $K_n$ be the complete graph with $n$ vertices and $c_1, c_2, ..., c_r$ be $r$ different colors. Suppose we randomly and uniformly color the edges of $K_n$ in $c_1, c_2, ..., c_r$. Then we get a random graph, denoted by…

Let $\mathcal{C}$ be a family of edge-colored graphs. A $t$-edge colored graph $G$ is $(\mathcal{C}, t)$-saturated if $G$ does not contain any graph in $\mathcal{C}$ but the addition of any edge in any color in $[t]$ creates a copy of some…

Bicliques are complements of bipartite graphs; as such each consists of two cliques joined by a number of edges. In this paper we study algebraic aspects of the chromatic polynomials of these graphs. We derive a formula for the chromatic…

We study the set of curvature functions which a given compact manifold with boundary can possess. First, we prove that the sign demanded by the Gauss-Bonnet Theorem is a necessary and sufficient condition for a given function to be the…

For each commutative, graded algebra with finite dimension in each degree, we construct a graded cohomology theory for graphs whose graded Euler characteristic is the chromatic polynomial of the graph. This extends our previous work which…

We propose the graph description of Teichm\"uller theory of surfaces with marked points on boundary components (bordered surfaces). Introducing new parameters, we formulate this theory in terms of hyperbolic geometry. We can then describe…

We study a generalisation of Vizing's theorem, where the goal is to simultaneously colour the edges of graphs $G_1,\dots,G_k$ with few colours. We obtain asymptotically optimal bounds for the required number of colours in terms of the…

A graph $G$ has the Perfect-Matching-Hamiltonian property (PMH-property) if for each one of its perfect matchings, there is another perfect matching of $G$ such that the union of the two perfect matchings yields a Hamiltonian cycle of $G$.…

For a graph $G$ and a not necessarily proper $k$-edge coloring $c:E(G)\to \{ 1,\ldots,k\}$, let $m_i(G)$ be the number of edges of $G$ of color $i$, and call $G$ {\it color-balanced} if $m_i(G)=m_j(G)$ for every two colors $i$ and $j$.…

The coloured Tverberg theorem was conjectured by B\'ar\'any, Lov\'{a}sz and F\"uredi and asks whether for any d+1 sets (considered as colour classes) of k points each in R^d there is a partition of them into k colourful sets whose convex…

The Hilbert space effect algebra is a fundamental mathematical structure which is used to describe unsharp quantum measurements in Ludwig's formulation of quantum mechanics. Each effect represents a quantum (fuzzy) event. The relation of…