相关论文: Some Exceptional Cases in Mathematics: Euler Chara…
We introduce a new class of matroids, called graph curve matroids. A graph curve matroid is associated to a graph and defined on the vertices of the graph as a ground set. We prove that these matroids provide a combinatorial description of…
The aim of this paper is to derive on the basis of the Euler's formula several analytical relations which hold for certain classes of planar graphs and which can be useful in algorithmic graph theory.
The main goal of this note is to provide a First-Order Logic with Betweenness (FOLB) axiomatization of the main classes of graphs occurring in Metric Graph Theory, in analogy to Tarski's axiomatization of Euclidean geometry. We provide such…
We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]
Graph theory provides fundamental concepts for many fields of science like statistical physics, network analysis and theoretical computer science. Here we give a pedagogical introduction to graph theory, divided into three sections. In the…
Inspired by Kontsevich's graphic orbifold Euler characteristic we define a virtual Euler characteristic for any finite set of isomorphism classes of matroids of rank $r$. Our main result provides a simple formula for the virtual Euler…
This note studies the behavior of Euler characteristics and of intersection homology Euler characterstics under proper morphisms of algebraic (or analytic) varieties. The methods also yield, for algebraic (or analytic) varieties, formulae…
We relate Fubini's theorem for Euler characteristics to Riemann-Hurwtiz formulae, and reprove a classical result of Iversen. The techniques used include algebraic geometry, complex geometry, and model theory. Possible applications to the…
This work is devoted to the study of the relationships between graph theory and the qualitative analysis of ordinary differential equations, with a special focus on two-dimensional systems. In particular, we reinterpret classical results…
There has recently been much interest in the $C^*$-algebras of directed graphs. Here we consider product systems $E$ of directed graphs over semigroups and associated $C^*$-algebras $C^*(E)$ and $\mathcal{T}C^*(E)$ which generalise the…
We present an algebraic generalization of Euler's theorem for quadrilaterals. Starting from the parallelogram identity in an inner product space, we derive Apollonius' identity and obtain Euler's quadrilateral identity in a unified vector…
Can the cross product be generalized? Why are the trace and determinant so important in matrix theory? What do all the coefficients of the characteristic polynomial represent? This paper describes a technique for `doodling' equations from…
Euler systems are certain compatible families of cohomology classes, which play a key role in studying the arithmetic of Galois representations. We briefly survey the known Euler systems, and recall a standard conjecture of Perrin-Riou…
Wei's celebrated Duality Theorem is generalized in several ways, expressed as duality theorems for linear codes over division rings and, more generally, duality theorems for matroids. These results are further generalized, resulting in two…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
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 study the crossing matrix of a braid and introduce a polynomial invariant for braid systems that is invariant under Hurwitz equivalence. As an application to the study of surface braids and surface links, we also define an invariant that…
We establish the following splitter theorem for graphs and its generalization for matroids: Let $G$ and $H$ be $3$-connected simple graphs such that $G$ has an $H$-minor and $k:=|V(G)|-|V(H)|\ge 2$. Let $n:=\left\lceil k/2\right\rceil+1$.…
In their seminal paper from 1983, Erd\H{o}s and Szemer\'edi showed that any $n$ distinct integers induce either $n^{1+\epsilon}$ distinct sums of pairs or that many distinct products, and conjectured a lower bound of $n^{2-o(1)}$. They…
In this paper we give an attempt to extend some arithmetic properties such as multiplicativity, convolution products to the setting of operators theory. We provide a significant examples which are of interest in number theory. We also give…