Related papers: The Signed Weighted Resolution Set is Not a Comple…
Given a group endowed with a Z/2-valued morphism we associate a Gauss diagram theory, and show that for a particular choice of the group these diagrams encode faithfully virtual knots on a given arbitrary surface. This theory contains all…
We obtain a localized version of the configuration space integral for the Casson knot invariant, where the standard symmetric Gauss form is replaced with a locally supported form. An interesting technical difference between the arguments…
We prove a symplectic version of a conjecture of Lian and Pandharipande: in sufficiently high degree, the fixed-domain Gromov-Witten invariants of positive symplectic manifolds are signed counts of pseudo-holomorphic curves. The original…
Chern-Simons gauge theory for compact semisimple groups is analyzed from a perturbation theory point of view. The general form of the perturbative series expansion of a Wilson line is presented in terms of the Casimir operators of the gauge…
This paper introduces a novel approach for learning polynomial representations of physical objects. Given a point cloud data set associated with a physical object, we solve a one-class classification problem to bound the data points by a…
This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…
A secure set $S$ in a graph is defined as a set of vertices such that for any $X\subseteq S$ the majority of vertices in the neighborhood of $X$ belongs to $S$. It is known that deciding whether a set $S$ is secure in a graph is…
In this article, we investigate the BPS invariants associated with framed links. We extend the relationship between the algebraic curve (i.e. dual $A$-polynomial) and the BPS invariants of a knot investigated in \cite{GKS} to the case of a…
New lower bounds on the unknotting number of a knot are constructed from the classical knot signature function. These bounds can be twice as strong as previously known signature bounds. They can also be stronger than known bounds arising…
We study the stable matching problem in non-bipartite graphs with incomplete but strict preference lists, where the edges have weights and the goal is to compute a stable matching of minimum or maximum weight. This problem is known to be…
Self-supervised methods have recently proved to be nearly as effective as supervised ones in various imaging inverse problems, paving the way for learning-based approaches in scientific and medical imaging applications where ground truth…
We consider how the problem of determining normal forms for a specific class of nonholonomic systems leads to various interesting and concrete bridges between two apparently unrelated themes. Various ideas that traditionally pertain to the…
We obtain weighted $L^p$ inequalities for pseudo-differential operators with smooth symbols and their commutators by using a class of new weight functions which include Muckenhoupt weight functions. Our results improve essentially some…
Introduced in arXiv:2211.12606, biquandle arrow weight invariants are enhancements of the biquandle counting invariant for oriented virtual and classical knots defined from biquandle-colored Gauss diagrams using a tensor over an abelian…
We propose a signal analysis tool based on the sign (or the phase) of complex wavelet coefficients, which we call a signature. The signature is defined as the fine-scale limit of the signs of a signal's complex wavelet coefficients. We show…
In this paper we study generalized weights as an algebraic invariant of a code. We first describe anticodes in the Hamming and in the rank metric, proving in particular that optimal anticodes in the rank metric coincide with…
We newly revisit the gauge non-invariant chiral Schwinger model with a=1 in view of the chain structure. As a result, we show that the Dirac brackets can be easily read off from the exact symplectic algebra of second-class constraints.…
Deep networks learn internal representations whose geometry--how features bend, rotate, and evolve--affects both generalization and robustness. Existing similarity measures such as CKA or SVCCA capture pointwise overlap between activation…
We give a procedure that can be used to automatically satisfy invariants of a certain shape. These invariants may be written with the operations intersection, composition and converse over binary relations, and equality over these…
This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…