Related papers: The combinatorial cost

We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.

Basic invariants of binary forms over $\mathbb C$ up to degree 6 (and lower degrees) were constructed by Clebsch and Bolza in the 19-th century using complicated symbolic calculations. Igusa extended this to algebraically closed fields of…

Let $\vee^k A$ be the $k$-th symmetric tensor power of $A\in M_n(\mathbb{C})$. In \cite{IAM}, we have expressed the normalized trace of $\vee^kA$ as an integral of the $k$-th powers of the numerical values of $A$ over the unit sphere…

We generalize the geometric sequence $\{a^p, a^{p-1}b, a^{p-2}b^2,...,b^p\}$ to allow the $p$ copies of $a$ (resp. $b$) to all be different. We call the sequence $\{a_1a_2a_3\cdots a_p, b_1a_2a_3\cdots a_p, b_1b_2a_3\cdots a_p,\ldots,…

To a finite, connected, unoriented graph of Betti-number g>=2 and valencies >=3 we associate a finitely summable, commutative spectral triple (in the sense of Connes), whose induced zeta functions encode the graph. This gives another…

We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of real projective varieties. Here numerical means that the algorithm is numerically stable (in a sense to be made precise).…

It is known that, if removing some $n$ edges from a graph $\Gamma$ destroys all subgraphs isomorphic to a given finite graph $K$, then all subgraphs isomorphic to $K$ can be destroyed by removing at most $|E(K)|\cdot n$ edges, which form a…

One of the difficulties encountered when studying physical theories in discrete space-time is that of describing the underlying continuous symmetries (like Lorentz, or Galilei invariance). One of the ways of addressing this difficulty is to…

Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…

In this paper we establish the relationships between theta functions of arbitrary order and their derivatives. We generalize our previous work math.AG/0310085 and prove that for any n>1 the map sending an abelian variety to the set of Gauss…

We define derived equivalent invariants for gentle algebras, constructed in an easy combinatorial way from the quiver with relations defining these algebras. Our invariants consist of pairs of natural numbers and contain important…

We define new higher-order Alexander modules $\mathcal{A}_n(C)$ and higher-order degrees $\delta_n(C)$ which are invariants of the algebraic planar curve $C$. These come from analyzing the module structure of the homology of certain…

We show that every intermediate $\beta$-transformation is topologically conjugate to a greedy $\beta$-transformation with a hole at zero, and provide a counterexample illustrating that the correspondence is not one-to-one. This…

We introduce a new infinite family of enhancements of the biquandle homset invariant called biquandle arrow weights. These invariants assign weights in an abelian group to intersections of arrows in a Gauss diagram representing a classical…

Link homotopy has been an active area of research for knot theorists since its introduction by Milnor in the 1950s. We introduce a new equivalence relation on spatial graphs called component homotopy, which reduces to link homotopy in the…

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

To any nodal curve $C$ is associated the degree class group, a combinatorial invariant which plays an important role in the compactification of the generalised Jacobian of $C$ and in the construction of the N\'eron model of the Picard…

Let $G$ be a simple undirected $n$-vertex graph with the characteristic polynomial of its Laplacian matrix $L(G)$, $\det (\lambda I - L (G))=\sum_{k = 0}^n (-1)^k c_k \lambda^{n - k}$. Laplacian--like energy of a graph is newly proposed…

This paper deals with lattice congruences of the weak order on the symmetric group, and initiates the investigation of the cover graphs of the corresponding lattice quotients. These graphs also arise as the skeleta of the so-called…

Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…