Related papers: Dilators and the reverse mathematics zoo
We study so called regular Lie algebras, i.e. Lie algebras in which each nonzero element is regular. We make a connection with an open problem whether any element of reduced trace zero in a simple associative algebra is a commutator.
Discrete structures are currently second-class in differentiable programming. Since functions over discrete structures lack overt derivatives, differentiable programs do not differentiate through them and limit where they can be used. For…
Automatic differentiation, also known as backpropagation, AD, autodiff, or algorithmic differentiation, is a popular technique for computing derivatives of computer programs accurately and efficiently. Sometimes, however, the derivatives…
The goal and the main result of the paper is to provide a complete description of the field of rational differential invariants of one class of second order ordinary differential equations with scalar control parameter with respect to Lie…
An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general…
We study the reverse mathematics of interval orders. We establish the logical strength of the implications between various definitions of the notion of interval order. We also consider the strength of different versions of the…
If the result of an expensive computation is invalidated by a small change to the input, the old result should be updated incrementally instead of reexecuting the whole computation. We incrementalize programs through their derivative. A…
A big-isotropic structure is a generalization of the notion of Dirac structure, due to Vaisman. We discuss the inverse problem of deciding if a vector field is Hamiltonian having a big-isotropic structure as underlying geometry. In [1] we…
Automatic differentiation (AD) aims to compute derivatives of user-defined functions, but in Turing-complete languages, this simple specification does not fully capture AD's behavior: AD sometimes disagrees with the true derivative of a…
Most zeroth-order optimization algorithms mimic a first-order algorithm but replace the gradient of the objective function with some gradient estimator that can be computed from a small number of function evaluations. This estimator is…
We describe a new construction of an incoherent dictionary, referred to as the oscillator dictionary, which is based on considerations in the representation theory of finite groups. The oscillator dictionary consists of order of p^5 unit…
It is known that the M\"obius function in number theory is higher order oscillating. In this paper we show that there is another kind of higher order oscillating sequences in the form $(e^{2\pi i \alpha \beta^{n}g(\beta)})_{n\in \N}$, for a…
We show that no total functional can uniformly transform $\Pi_1$ primality into explicit $\Sigma_1$ witnesses without violating normalization in $\mathsf{HA}$. The argument proceeds through three complementary translations: a geometric…
A matrix $A$ is called totally positive (TP) if all its minors are positive, and totally nonnegative (TN) if all its minors are nonnegative. A square matrix $A$ is called oscillatory if it is TN and some power of $A$ is TP. A linear…
SO(2,1) is the symmetry algebra for a class of three-parameter problems that includes the oscillator, Coulomb and Morse potentials as well as other problems at zero energy. All of the potentials in this class can be mapped into the…
Rectangulations are partitions of a square into axis-aligned rectangles. A number of results provide bijections between combinatorial equivalence classes of rectangulations and families of pattern-avoiding permutations. Other results deal…
We prove that several versions of the Tietze extension theorem for functions with moduli of uniform continuity are equivalent to WKL_0 over RCA_0. This confirms a conjecture of Giusto and Simpson that was also phrased as a question in…
Integral discriminants provide a simple and fundamental model for non-Gaussian integrals, associated with homogeneous polynomials of degree r in n variables. We argue that, in this context, the study of correlators is equally if not more…
A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…
Differential operators usually result in derivatives expressed as a ratio of differentials. For all but the simplest derivatives, these ratios are typically not algebraically manipulable, but must be held together as a unit in order to…