Searcharxiv⌕ Search

arXiv subjects

Tamás Kálmán

Publications and source records attributed to Tamás Kálmán.

At least 19 recordsLinked to original sources

A deletion-contraction formula and monotonicity properties for the polymatroid Tutte polynomial

The Tutte polynomial is a fundamental invariant of matroids. The polymatroid Tutte polynomial $\mathscr{T}_{P}(x,y)$, introduced by Bernardi, Kálmán, and Postnikov, is an extension of the classical Tutte polynomial from matroids to polymatroids $P$. In this paper, we first obtain a deletion-contraction formula for $\mathscr{T}_{P}(x,y)$. Then we prove two natural properties of coefficientwise monotonicity, one for containment and one for minors, both for the interior polynomial $x^{n}\mathscr{T}_{P}(x^{-1},1)$ and the exterior polynomial $y^{n}\mathscr{T}_{P}(1,y^{-1})$, where $P$ is a polymatroid over $[n]$. We show by an example that these monotonicity properties do not extend to $\mathscr{T}_{P}(x,y)$. Using deletion-contraction, we obtain formulas for the coefficients of terms of degree $n-1$ in $\mathscr{T}_{P}(x,y)$. Finally, we characterize hypergraphs $\mathcal{H}=(V,E)$ such that the coefficient of $y^{k}$ in the exterior polynomial of the associated polymatroid $P_{\mathcal{H}}$ attains its maximal value $\binom{|V|+k-2}{k}$ for all $k$ up to some bound.

math.CO↗

Defect Positioning in Combinatorial Metamaterials

Combinatorial mechanical metamaterials are made of anisotropic, flexible blocks, such that multiple metamaterials may be constructed using a single block type, and the system's response depends on the frustration (or its absence) due to the mutual orientations of the blocks within the lattice. Specifically, any minimal loop of blocks that may not simultaneously deform in their softest mode defines a mechanical defect at the vertex (in two dimensions) or edge (in three dimensions) that the loop encircles. Defects stiffen the metamaterial, and allow to design the spatial patterns of stress and deformation as the system is externally loaded. We study the ability to place defects at arbitrary positions in metamaterials made of a family of block types that we recently introduced for the square, honeycomb, and cubic lattices. Alongside blocks for which we show that any defect configuration is possible, we identify situations in which not all sets are realizable as defects. One of the restrictions is that in three dimensions, defected edges form closed curves. Even in cases when not all geometries of defect lines are possible, we show how to produce defect lines of arbitrary knottedness.

cond-mat.soft↗

Breaking Mechanical Holography in Combinatorial Metamaterials

Combinatorial mechanical metamaterials are made of anisotropic, flexible blocks, such that multiple metamaterials may be constructed using a single block type, and the system's response strongly depends on the mutual orientations of the blocks within the lattice. We study a family of possible block types for the square, honeycomb, and cubic lattices. Blocks that are centrally symmetric induce holographic order, such that mechanical compatibility (meaning that blocks do not impede each other's motion) implies bulk-boundary coupling. With them, one can design a compatible metamaterial that will deform in any desired texture only on part of its boundary. With blocks that break holographic order, we demonstrate how to design the deformation texture on the entire boundary. Correspondingly, the number of compatible holographic metamaterials scales exponentially with the boundary, while in non-holographic cases we show that it scales exponentially with the bulk.

cond-mat.soft↗

Trapezodial property of the generalized Alexander polynomial

Fox's conjecture from 1962, that the absolute values of the coefficients of the Alexander polynomial of an alternating link are trapezoidal, has remained stubbornly open to this date. Recently Fox's conjecture was settled for all special alternating links. In this paper we take a broad view of the Alexander polynomials of special alternating links, showing that they are a generating function for a statistic on certain vector configurations. We study three types of vector configurations: (1) vectors arising from cographic matroids, (2) vectors arising from graphic matroids, (3) vectors arising from totally positive matrices. We prove that Alexander polynomials of special alternating links belong to both classes (1) and (2), and prove log-concavity, respectively trapezoidal, properties for classes (2) and (3). As a special case of our results, we obtain a new proof of Fox's conjecture for special alternating links.

math.CO↗

Graph minors, Ehrhart theory, and a monotonicity property

We study the extended root polytope associated to a directed graph. We show that under the operations of deletion and contraction of an edge of the graph, none of the coefficients of the $h^*$-polynomial of the associated extended root polytope increase. We examine cases when the $h^*$-polynomial does not change, for instance when contracting the edges of a minimal directed join in a digraph whose lattice polytope has the Gorenstein property.

math.CO↗

Degrees of interior polynomials and parking function enumerators

The interior polynomial of a directed graph is defined as the $h^*$-polynomial of the graph's (extended) root polytope, and it displays several attractive properties. Here we express its degree in terms of the minimum cardinality of a directed join, and give a formula for the leading coefficient. We present natural generalizations of these results to oriented regular matroids; in the process we also give a facet description for the extended root polytope of an oriented regular matroid. By duality, our expression for the degree of the interior polynomial implies a formula for the degree of the parking function enumerator of an Eulerian directed graph (which is equivalent to the greedoid polynomial of the corresponding branching greedoid). We extend that result to obtain the degree of the parking function enumerator of an arbitrary rooted directed graph in terms of the minimum cardinality of a certain type of feedback arc set.

math.CO↗

Homotopy classification of knotted defects in ordered media

We give a homotopy classification of the global defects in ordered media, and explain it via the example of biaxial nematic liquid crystals, i.e., systems where the order parameter space is the quotient of the $3$-sphere $S^3$ by the quaternion group $Q$. As our mathematical model we consider continuous maps from complements of spatial graphs to the space $S^3/Q$ modulo a certain equivalence relation, and find that the equivalence classes are enumerated by the six subgroups of $Q$. Through monodromy around meridional loops, the edges of our spatial graphs are marked by conjugacy classes of $Q$; once we pass to planar diagrams, these labels can be refined to elements of $Q$ associated to each arc. The same classification scheme applies not only in the case of $Q$ but also to arbitrary groups.

cond-mat.soft↗

On Fox's trapezoidal conjecture

We investigate Fox's trapezoidal conjecture for alternating links. We show that it holds for diagrammatic Murasugi sums of special alternating links, where all sums involved have length less than three (which includes diagrammatic plumbing). It also holds for links containing a large twist region, which we call twist-concentrated. Furthermore, we show some weaker inequalities between consecutive coefficients of the Alexander polynomial of an alternating 3-braid closure, and extend this to arbitrary alternating links. We then study an extension of the trapezoidal conjecture due to Hirasawa and Murasugi, which states that the stable length of the Alexander polynomial of an alternating link can be bounded from above using the signature. We estabilish this and determine when equality holds for diagrammatic Murasugi sums of special alternating knots where each sum has length less than three, and also for twist-concentrated 3-braids. Finally, we study the behavior of the Hirasawa-Murasugi inequality under concordance.

math.GT↗

$h^*$-vectors of graph polytopes using activities of dissecting spanning trees

Symmetric edge polytopes of graphs and root polytopes of semi-balanced digraphs are two classes of lattice polytopes whose $h^*$-polynomials have interesting properties and generalize important graph polynomials. For both classes of polytopes there are large, natural classes of dissections into unimodular simplices. These are such that the simplices correspond to certain spanning trees. We show that for any ``spanning tree dissection'' of the symmetric edge polytope of a graph, or the root polytope of a semi-balanced digraph, the $h^*$-polynomial of the polytope can be computed as a generating function of certain activities of the corresponding spanning trees. Apart from giving simple and flexible algorithms for computing these polynomials, our results also reveal that all dissections in question are surprisingly similar to each other: It turns out that the distributions of many statistics of spanning tree dissections are in fact independent of the actual dissection.

math.CO↗

Root polytopes and Jaeger-type dissections for directed graphs

We associate root polytopes to directed graphs and study them by using ribbon structures. Most attention is paid to what we call the semi-balanced case, i.e., when each cycle has the same number of edges pointing in the two directions. Given a ribbon structure, we identify a natural class of spanning trees and show that, in the semi-balanced case, they induce a shellable dissection of the root polytope into maximal simplices. This allows for a computation of the $h^*$-vector of the polytope and for showing some properties of this new graph invariant, such as a product formula and that in the planar case, the $h^*$-vector is equivalent to the greedoid polynomial of the dual graph. We obtain a general recursion relation as well. We also work out the case of layer-complete directed graphs, where our method recovers a previously known triangulation. Indeed our dissection is often but not always a triangulation; we address this with a series of examples.

math.CO↗

Ehrhart theory of symmetric edge polytopes via ribbon structures

Using a ribbon structure of the graph, we construct a dissection of the symmetric edge polytope of a graph into unimodular simplices. Our dissection is shellable, and one can interpret the elements of the resulting $h$-vector via graph theory. This gives an elementary method for computing the $h^*$-vector of the symmetric edge polytope.

math.CO↗

Hypergraph polynomials and the Bernardi process

Recently O. Bernardi gave a formula for the Tutte polynomial $T(x,y)$ of a graph, based on spanning trees and activities just like the original definition, but using a fixed ribbon structure to order the set of edges in a different way for each tree. The interior polynomial $I$ is a generalization of $T(x,1)$ to hypergraphs. We supply a Bernardi-type description of $I$ using a ribbon structure on the underlying bipartite graph $G$. Our formula works because it is determined by the Ehrhart polynomial of the root polytope of $G$ in the same way as $I$ is. To prove this we interpret the Bernardi process as a way of dissecting the root polytope into simplices, along with a shelling order. We also show that our generalized Bernardi process gives a common extension of bijections (and their inverses) constructed by Baker and Wang between spanning trees and break divisors.

math.CO↗

The sandpile group of a trinity and a canonical definition for the planar Bernardi action

Baker and Wang define the so-called Bernardi action of the sandpile group of a ribbon graph on the set of its spanning trees. This potentially depends on a fixed vertex of the graph but it is independent of the base vertex if and only if the ribbon structure is planar, moreover, in this case the Bernardi action is compatible with planar duality. Earlier, Chan, Church and Grochow and Chan, Glass, Macauley, Perkinson, Werner and Yang proved analogous results about the rotor-routing action. Baker and Wang moreover showed that the Bernardi and rotor-routing actions coincide for plane graphs. We clarify this still confounding picture by giving a canonical definition for the planar Bernardi/rotor-routing action, and also a canonical isomorphism between sandpile groups of planar dual graphs. Our canonical definition implies the compatibility with planar duality via an extremely short argument. We also show hidden symmetries of the problem by proving our results in the slightly more general setting of balanced plane digraphs. Any balanced plane digraph gives rise to a trinity, i.e., a triangulation of the sphere with a three-coloring of the $0$-simplices. Our most important tool is a group associated to trinities, introduced by Cavenagh and Wanless, and a result of a subset of the authors characterizing the Bernardi bijection in terms of a dissection of a root polytope.

math.CO↗

Ruling invariants for Legendrian graphs

We define ruling invariants for even-valence Legendrian graphs in standard contact three-space. We prove that rulings exist if and only if the DGA of the graph, introduced by the first two authors, has an augmentation. We set up the usual ruling polynomials for various notions of gradedness and prove that if the graph is four-valent, then the ungraded ruling polynomial appears in Kauffman-Vogel's graph version of the Kauffman polynomial. Our ruling invariants are compatible with certain vertex-identifying operations as well as vertical cuts and gluings of front diagrams. We also show that Leverson's definition of a ruling of a Legendrian link in a connected sum of $S^1 \times S^2$'s can be seen as a special case of ours.

math.SG↗

Clock theorems for triangulated surfaces

We investigate triangulations of the two-dimensional sphere and torus with the faces properly colored white and black. We focus on matchings between white triangles and incident vertices. On the torus our objects are perfect pairings, whereas on the sphere this is only true after removing one triangle and its vertices. In the latter case, such matchings (first studied by Tutte) extend the notion of state in Kauffman's formal knot theory and we show that his Clock Theorem, in its form due to Gilmer and Litherland, also extends: the set of matchings naturally forms a distributive lattice. Here the role of state transposition is played by a simple local operation about black triangles. By contrast, on the torus, the analogous state transition graph is usually disconnected: some of its components still form distributive lattices with global maxima and minima, while other components contain directed cycles and are without local extrema.

math.CO↗

Tight contact structures on Seifert surface complements

We consider complements of standard Seifert surfaces of special alternating links. On these handlebodies, we use Honda's method to enumerate those tight contact structures whose dividing sets are isotopic to the link, and find their number to be the leading coefficient of the Alexander polynomial. The Euler classes of the contact structures are identified with hypertrees in a certain hypergraph. Using earlier work, this establishes a connection between contact topology and the Homfly polynomial. We also show that the contact invariants of our tight contact structures form a basis for sutured Floer homology. Finally, we relate our methods and results to Kauffman's formal knot theory.

math.GT↗

Root polytopes, Tutte polynomials, and a duality theorem for bipartite graphs

Let G be a connected bipartite graph with color classes E and V and root polytope Q. Regarding the hypergraph (V,E) induced by G, we prove that its interior polynomial is equivalent to the Ehrhart polynomial of Q, which in turn is equivalent to the h-vector of any triangulation of Q. It follows that the interior polynomials of (V,E) and its transpose (E,V) agree. When G is a complete bipartite graph, our result recovers a well known hypergeometric identity due to Saalschütz. It also implies that certain extremal coefficients in the Homfly polynomial of a special alternating link can be read off of an associated Floer homology group.

math.CO↗

Root polytopes, parking functions, and the HOMFLY polynomial

We show that for a special alternating link diagram, the following three polynomials are essentially the same: a) the part of the HOMFLY polynomial that corresponds to the leading term in the Alexander polynomial; b) the $h$-vector for a triangulation of the root polytope of the Seifert graph and c) the enumerator of parking functions for the planar dual of the Seifert graph. These observations yield formulas for the maximal $z$-degree part of the HOMFLY polynomial of an arbitrary homogeneous link as well. Our result is part of a program aimed at reading HOMFLY coefficients out of Heegaard Floer homology.

math.GT↗