Related papers: Term Coding: An Entropic Framework for Extremal Co…
A language L over a finite alphabet is growth-sensitive (or entropy sensitive) if forbidding any set of subwords F yields a sub-language L^F whose exponential growth rate (entropy) is smaller than that of L. Let (X, E, l) be an infinite,…
In combinatorics on words, a word $w$ over an alphabet $\Sigma$ is said to avoid a pattern $p$ over an alphabet $\Delta$ if there is no factor $f$ of $w$ such that $f= (p)$ where $h: \Delta^*\to\Sigma^*$ is a non-erasing morphism. A pattern…
We consider a task in which classical information is encoded into a quantum system by an operation restricted by symmetry. The maximum amount of classical information that can be encoded under this restriction, namely the…
We introduce graphical error-correcting codes, a new notion of error-correcting codes on $[q]^n$, where a code is a set of proper $q$-colorings of some fixed $n$-vertex graph $G$. We then say that a set of $M$ proper $q$-colorings of $G$…
There is a large literature devoted to the problem of finding an optimal (min-cost) prefix-free code with an unequal letter-cost encoding alphabet of size. While there is no known polynomial time algorithm for solving it optimally there are…
A fundamental problem in quantum coding theory is to determine the maximum size of quantum codes of given block length and distance. A recent work introduced bounds based on semidefinite programming, strengthening the well-known quantum…
We give alternative definitions for maximum matching width, e.g. a graph $G$ has $\operatorname{mmw}(G) \leq k$ if and only if it is a subgraph of a chordal graph $H$ and for every maximal clique $X$ of $H$ there exists $A,B,C \subseteq X$…
Overlaps between words are crucial in many areas of computer science, such as code design, stringology, and bioinformatics. A self overlapping word is characterized by its periods and borders. A period of a word $u$ is the starting position…
We study the complexity of constraint satisfaction problems for templates $\Gamma$ that are first-order definable in $(\Bbb Z; succ)$, the integers with the successor relation. Assuming a widely believed conjecture from finite domain…
Let CMSO denote the counting monadic second order logic of graphs. We give a constructive proof that for some computable function $f$, there is an algorithm $\mathfrak{A}$ that takes as input a CMSO sentence $\varphi$, a positive integer…
Many combinatorial optimization problems can be phrased in the language of constraint satisfaction problems. We introduce a graph neural network architecture for solving such optimization problems. The architecture is generic; it works for…
This paper aims to provide an unsupervised modelling approach that allows for a more flexible representation of text embeddings. It jointly encodes the words and the paragraphs as individual matrices of arbitrary column dimension with unit…
Formula retrieval is an important topic in Mathematical Information Retrieval. We propose SSEmb, a novel embedding framework capable of capturing both structural and semantic features of mathematical formulas. Structurally, we employ Graph…
Let $\Gamma$ be a finite group, let $\theta$ be an involution of $\Gamma$, and let $\rho$ be an irreducible complex representation of $\Gamma$. We bound $\dim \rho^{\Gamma^{\theta}}$ in terms of the smallest dimension of a faithful…
A storage code over a graph maps $K$ independent source symbols, each of $L_w$ bits, to $N$ coded symbols, each of $L_v$ bits, such that each coded symbol is stored in a node of the graph and each edge of the graph is associated with one…
Analytic continuation of numerical data obtained in imaginary time or frequency has become an essential part of many branches of quantum computational physics. It is, however, an ill-conditioned procedure and thus a hard numerical problem.…
Based on the algorithmic proof of Lov\'asz local lemma due to Moser and Tardos, the works of Grytczuk et al. on words, and Dujmovi\'c et al. on colorings, Esperet and Parreau developed a framework to prove upper bounds for several chromatic…
Morris and Saxton used the method of containers to bound the number of $n$-vertex graphs with $m$ edges containing no $\ell$-cycles, and hence graphs of girth more than $\ell$. We consider a generalization to $r$-uniform hypergraphs. The…
In this paper we study bipartite quantum correlations using techniques from tracial noncommutative polynomial optimization. We construct a hierarchy of semidefinite programming lower bounds on the minimal entanglement dimension of a…
High-order phenomena play crucial roles in many systems of interest, but their analysis is often highly nontrivial. There is a rich literature providing a number of alternative information-theoretic quantities capturing high-order…