Related papers: Invariant Bridges Between Four Successive Points: …
Given a matching between n red points and n blue points by line segments in the plane, we consider the problem of obtaining a crossing-free matching through flip operations that replace two crossing segments by two non-crossing ones. We…
We consider $N\times N$ tensors for $N= 3,4,5,6$. In the case $N=3$, it is desired to find the three principal invariants $i_1, i_2, i_3$ of $\bf U$ in terms of the three principal invariants $I_1, I_2, I_3$ of ${\bf C}={\bf U}^2$.…
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…
A strong interaction is known to exist between edge-colored graphs (which encode PL pseudo-manifolds of arbitrary dimension) and random tensor models (as a possible approach to the study of Quantum Gravity). The key tool is the {\it…
Inverse problems of partial differential equations are ubiquitous across various scientific disciplines and can be formulated as statistical inference problems using Bayes' theorem. To address large-scale problems, it is crucial to develop…
The N = 2, 4 superconformal symmetry constraints in d = 4 for four point functions of chiral primary 1/2-BPS operators are derived. The operators are described by symmetric traceless tensors of the internal R-symmetry group. A substantial…
We introduce a novel method for encoding integers using smooth real-valued functions whose integral properties implicitly reflect discrete quantities. In contrast to classical representations, where the integer appears as an explicit…
We characterise and enumerate permutations that are sortable by n-4 passes through a stack. We conjecture the number of permutations sortable by n-5 passes, and also the form of a formula for the general case n-k, which involves a…
Graph neural networks (GNNs) are widely used for learning on structured data, yet their ability to distinguish non-isomorphic graphs is fundamentally limited. These limitations are usually attributed to message passing; in this work we show…
The Reshetikhin-Turaev invariant, Turaev's TQFT, and many related constructions rely on the encoding of certain tangles (n-string links, or ribbon n-handles) as n-forms on the coend of a ribbon category. We introduce the monoidal category…
Starting with an algorithm to turn lists into full trees which uses non-obvious invariants and partial functions, we progressively encode the invariants in the types of the data, removing most of the burden of a correctness proof. The…
Multiplication is one of the most fundamental computational problems, yet its true complexity remains elusive. The best known upper bound, by F\"{u}rer, shows that two $n$-bit numbers can be multiplied via a boolean circuit of size $O(n \lg…
We show that any permutation of ${1,2,...,N}$ can be written as the product of two involutions. As a consequence, any permutation of the elements of an array can be performed in-place in parallel in time O(1). In the case where the…
We propose a data-driven algorithm for numerical invariant synthesis and verification. The algorithm is based on the ICE-DT schema for learning decision trees from samples of positive and negative states and implications corresponding to…
Let $f$ be a postcritically finite rational map. We prove that, as $n$ large enough, there exists an $f^n$-invariant (finite connected) graph on $\widehat{\mathbb{C}}$ such that it contains the postcritical set of $f$.
Permutations over $F_{2^{2k}}$ with low differential uniform, high algebraic degree and high nonlinearity are of great cryptographical importance since they can be chosen as the substitution boxes (S-boxes) for many block ciphers. A well…
A linear inference is a valid inequality of Boolean algebra in which each variable occurs at most once on each side. In this work we leverage recently developed graphical representations of linear formulae to build an implementation that is…
For a prime p and base b, the digit function delta(r) = floor(br/p) partitions the residues {1, ..., p-1} into b contiguous bins. The collision count C(g) records how many residues share a bin with their image under multiplication by g. We…
We prove a general version of the classical Perron-Frobenius convergence property for reducible matrices. We then apply this result to reducible substitutions and use it to produce limit frequencies for factors and hence invariant measures…
In \cite{PrzytyskiTraczyk} J.H.Przytyski and P.Traczyk introduced an algebraic structure, called {\it a Conway algebra,} and constructed an invariant of oriented links, which is a generalization of the Homflypt polynomial invariant. On the…