Related papers: Asymmetric All-or-nothing Transforms
Recognizing symmetries in data allows for significant boosts in neural network training, which is especially important where training data are limited. In many cases, however, the exact underlying symmetry is present only in an idealized…
Quantum theory is widely regarded as fundamentally indeterministic, yet classical frameworks can also exhibit indeterminism once infinite information is abandoned. At the same time, relativity is usually taken to forbid superluminal…
Given a Banach space X and a bounded linear operator T on X, a subspace Y of X is almost invariant under T if TY is a subspace of Y+F for some finite-dimensional ``error'' F. In this paper, we study subspaces that are almost invariant under…
Transforming an asymmetric system into a symmetric system makes it possible to exploit the simplifying properties of symmetry in control problems. We define and characterize the family of symmetrizable systems, which can be transformed into…
The nonlinear Fourier transform (NFT), a powerful tool in soliton theory and exactly solvable models, is a method for solving integrable partial differential equations governing wave propagation in certain nonlinear media. The NFT…
We propose a definition of a non-invertible symmetry enriched topological order (NI-SETO), and we implement our definition for string net models. We do so in two ways, using full inclusions of unitary fusion categories (UFCs), as well as…
An association scheme is amorphous if it has as many fusion schemes as possible. Symmetric amorphous schemes were classified by A. V. Ivanov [A. V. Ivanov, Amorphous cellular rings II, in Investigations in algebraic theory of combinatorial…
We develop a topological lens on relational schema design by encoding functional dependencies (FDs) as simplices of an abstract simplicial complex. This dependency complex exposes multi-attribute interactions and enables homological…
The symmetric interaction combinators are an equally expressive variant of Lafont's interaction combinators. They are a graph-rewriting model of deterministic computation. We define two notions of observational equivalence for them,…
In this paper, two-to-one mappings and involutions without any fixed point on finite fields of even characteristic are investigated. First, we characterize a closed relationship between them by implicit functions and develop an AGW-like…
The method of asymptotics beyond all orders (ABAO) is known to be a useful tool to investigate separatrix splitting of several maps. For a class of simplectic maps, the form of maps is shown to be restricted by the conditions for the ABAO…
Homomorphic encryption is a method used in cryptopgraphy to create programs that can interact with encrypted data without ever leaving the data in the clear. This has many potential applications in cybersecurity. This paper uses…
Finite Unified Theories (FUTs) are N=1 supersymmetric Grand Unified Theories that can be made all-loop finite. The requirement of all-loop finiteness leads to a severe reduction of the free parameters of the theory and, in turn, to a large…
We introduce AOT, an anonymous communication system based on mix network architecture that uses oblivious transfer (OT) to deliver messages. Using OT to deliver messages helps AOT resist blending ($n-1$) attacks and helps AOT preserve…
The offset linear canonical transform (OLCT) provides a more general framework for a number of well known linear integral transforms in signal processing and optics, such as Fourier transform, fractional Fourier transform, linear canonical…
Given any finite subset $A$ of order $n$ of a distributive lattice and $k\in\{1,...,n\}$, there is a natural extension of the median operation to $n$ variables which generalizes the notion of the $k$th smallest element of $A$. By applying…
We analyze the optical properties of one-dimensional (1D) PT-symmetric structures of arbitrary complexity. These structures violate normal unitarity (photon flux conservation) but are shown to satisfy generalized unitarity relations, which…
We prove an impossibility result, which in the context of function learning says the following: under certain conditions, it is impossible to simultaneously learn symmetries and functions equivariant under them using an ansatz consisting of…
While model architectures and training strategies have become more generic and flexible with respect to different data modalities over the past years, a persistent limitation lies in the assumption of fixed quantities and arrangements of…
The unknotting number of a knot is the minimum number of crossings one must change to turn that knot into the unknot. The algebraic unknotting number is the minimum number of crossing changes needed to transform a knot into an Alexander…