Related papers: Invariant Bridges Between Four Successive Points: …
We establish several new results about both the (n)-solvable filtration, F_n^m, of the set of link concordance classes and the (n)-solvable filtration of the string link concordance group. We first establish a relationship between Milnor's…
We overcome the barrier of constructing N=4 superconformal models in one space dimension for more than three particles. The D(2,1;alpha) superalgebra of our systems is realized on the coordinates and momenta of the particles, their…
Link/knot invariants are series with integer coefficients, and it is a long-standing problem to get them positive and possessing cohomological interpretation. Constructing positive "superpolynomials" is not straightforward, especially for…
A simple least-squares optimisation enables the determination of the spectrum for irregularly sampled data that is readily reconstructed using an adjoint transformation of the Non-Uniform Fast Fourier Transform (NFFT). This is an…
Pretrained encoders for mathematical texts have achieved significant improvements on various tasks such as formula classification and information retrieval. Yet they remain limited in representing and capturing student strategies for entire…
We present a Feynman integral representation for the general momentum-space scalar $n$-point function in any conformal field theory. This representation solves the conformal Ward identities and features an arbitrary function of $n(n-3)/2$…
The Additive Transform of an arithmetic function represents a novel approach to examining the interplay between multiplicative arithmetic function and additive functions. This transform concept introduces a method to systematically generate…
Neural networks that satisfy invariance with respect to input permutations have been widely studied in machine learning literature. However, in many applications, only a subset of all input permutations is of interest. For heterogeneous…
In this paper upper bounds are given for the successive differences $A_{n+1}-A_{n}$ and B$_{n}-B_{n-1}$ where $A_{n}=1/(n-1) \tsum_{r=1}^{n-1}f(r/n)$, $B_{n}=1/(n+1) \tsum_{r=0}^{n}f(r/n)$ and $f$ is superquadratic function. We obtain…
In the 1950's Milnor defined a family of higher order invariants generalizing the linking number. Even the first of these new invariants, the triple linking number, has received and fruitful study since its inception. In the case that $L$…
Associated to analytic Hamiltonian vector fields in $\mathbb{C}^4$ having an equilibrium point satisfying a non semisimple $1:-1$ resonance, we construct two universal constants that are invariant with respect to local analytic symplectic…
We prove that any function with real-valued coefficients, whose input is 4 binary variables and whose output is a real number, is perfectly equivalent to a quadratic function whose input is 5 binary variables and is minimized over the new…
Integer iteration rules such as n |-> {a n + b, c n +d} are studied as minimal examples of the general process of multicomputation. Despite the simplicity of such rules, their multiway graphs can be complex, exhibiting, for example,…
Current neural architectures lack a principled way to handle interchangeable tokens, i.e., symbols that are semantically equivalent yet distinguishable, such as bound variables. As a result, models trained on fixed vocabularies often…
Linear network coding transmits data through networks by letting the intermediate nodes combine the messages they receive and forward the combinations towards their destinations. The solvability problem asks whether the demands of all the…
Permutation polynomials over finite fields are fundamental objects as they are used in various theoretical and practical applications in cryptography, coding theory, combinatorial design, and related topics. This family of polynomials…
The persistence barcode (equivalently, the persistence diagram), which can be obtained from the interval decomposition of a persistence module, plays a pivotal role in applications of persistent homology. For multi-parameter persistent…
Unlike vision and language domains, graph learning lacks a shared input space, as input features differ across graph datasets not only in semantics, but also in value ranges and dimensionality. This misalignment prevents graph models from…
We discuss multivariable invariants of colored links associated with the $N$-dimensional root of unity representation of the quantum group. The invariants for $N>2$ are generalizations of the multi-variable Alexander polynomial. The…
It is shown that there are no nilpotent invariants in N=4 analytic superspace for $n\leq4$ points. It is argued that there is (at least) one such invariant for n=5 points which is not invariant under U(1)_Y. The consequences of these…