Related papers: An Improved Separation of Regular Resolution from …

Godsil observed the simple fact that the multiplicity of 0 as a root of the matching polynomial of a graph coincides with the classical notion of deficiency. From this fact he asked to what extent classical results in matching theory…

We solve the two Diophantine equations $P_k=J_n+J_m$ and $Q_k=J_n+J_m$ where $\left\lbrace P_{k}\right\rbrace_{k\geq0}$, $\left\lbrace Q_{k}\right\rbrace_{k\geq0}$ and $\left\lbrace J_{k}\right\rbrace_{k\geq0}$ are the sequences of Pell…

This paper proposes new notions of polynomial depth (called monotone poly depth), based on a polynomial version of monotone Kolmogorov complexity. We show that monotone poly depth satisfies all desirable properties of depth notions i.e.,…

We revisit the Universal Approximation Theorem(UAT) through the lens of the tropical geometry of neural networks and introduce a constructive, geometry-aware initialization for sigmoidal multi-layer perceptrons (MLPs). Tropical geometry…

Tables have gained significant attention in large language models (LLMs) and multimodal large language models (MLLMs) due to their complex and flexible structure. Unlike linear text inputs, tables are two-dimensional, encompassing formats…

We define Ptolemy coordinates for representations that are not necessarily boundary-unipotent. This gives rise to a new algorithm for computing the SL(2,C) A-polynomial, and more generally the SL(n,C) A-varieties. We also give a formula for…

For a fixed simple digraph $H$ without isolated vertices, we consider the problem of deleting arcs from a given tournament to get a digraph which does not contain $H$ as an immersion. We prove that for every $H$, this problem admits a…

Many graph polynomials, such as the Tutte polynomial, the interlace polynomial and the matching polynomial, have both a recursive definition and a defining subset expansion formula. In this paper we present a general, logic-based framework…

We propose a Reinforcement Learning based approach to approximately solve the Tree Decomposition (TD) problem. TD is a combinatorial problem, which is central to the analysis of graph minor structure and computational complexity, as well as…

Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where the literals are rooted triples, is there a rooted binary…

Lie group theory states that knowledge of a $m$-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by $m$ the number of equation. We apply this principle by finding dilatations and…

A dichotomy theorem for counting problems due to Creignou and Hermann states that or any nite set S of logical relations, the counting problem #SAT(S) is either in FP, or #P-complete. In the present paper we show a dichotomy theorem for…

We prove that adaptive strategies offer no advantage over non-adaptive ones for learning and testing Pauli channels using entangled inputs. This key observation allows us to characterize the query complexity for several fundamental tasks by…

Accurate chart comprehension represents a critical challenge in advancing multimodal learning systems, as extensive information is compressed into structured visual representations. However, existing vision-language models (VLMs) frequently…

We analyse the problem of solving Boolean equation systems through the use of structure graphs. The latter are obtained through an elegant set of Plotkin-style deduction rules. Our main contribution is that we show that equation systems…

We obtain a hypergraph generalisation of the graph blow-up lemma proved by Komlos, Sarkozy and Szemeredi, showing that hypergraphs with sufficient regularity and no atypical vertices behave as if they were complete for the purpose of…

We describe several graphs with arbitrarily large rankwidth (or equivalently with arbitrarily large cliquewidth). Korpelainen, Lozin, and Mayhill [Split permutation graphs, Graphs and Combinatorics, 30(3):633-646, 2014] proved that there…

Given a graph G, an incidence matrix N(G) is defined for the set of distinct isomorphism types of induced subgraphs of G. If Ulam's conjecture is true, then every graph invariant must be reconstructible from this matrix, even when the…

So far, a very large amount of work in Natural Language Processing (NLP) rely on trees as the core mathematical structure to represent linguistic informations (e.g. in Chomsky's work). However, some linguistic phenomena do not cope properly…

In this paper we obtain precise asymptotics for certain families of graphs, namely circulant graphs and degenerating discrete tori. The asymptotics contain interesting constants from number theory among which some can be interpreted as…