Latest Research
Covering radii of $3$-zonotopes and the shifted Lonely Runner Conjecture
We show that the shifted Lonely Runner Conjecture (sLRC) holds for 5 runners.
Combinatorics Computational Geometry 52C17 (Primary), 52C07, 52B20, 52-04 I.3.5; G.2.1
Permutation-Avoiding FFT-Based Convolution
Fast Fourier Transform (FFT) libraries are widely used for evaluating discrete convolutions.
Numerical Analysis Data Structures and Algorithms Mathematical Software Numerical Analysis
SINDybrid: automatic generation of hybrid models for dynamic systems
This work highlights SINDybrid potential as a versatile, automated solution for hybrid modelling, significantly reducing the barriers to adopting hybrid methods in complex dynamic systems across scientific research and industrial applications.
Dynamical Systems
Automatic differentiation for Lax-Wendroff-type discretizations
The application of AD is similar for methods of any order and does not need positivity corrections during the predictor step.
Numerical Analysis Numerical Analysis Computational Physics 65M60, 65M22 G.1.8
The Generalized Fermat Equation $x^2 + y^3 = z^{25}$
We consider the generalized Fermat equation (*) $x^2 + y^3 = z^{25}$.
Number Theory 11G30, 11G35, 14K20
A note on the properties of the confidence set for the local average treatment effect obtained by inverting the score test
Moreover, we show that, at any fixed law, the score confidence set asymptotically coincides, up to a term of order 1/n, with the Wald confidence interval based on the doubly robust estimator which solves the estimating equation associated with the nonparametric influence function.
Statistics Theory Methodology Statistics Theory
The Classification of Graphs on $8$ vertices with Coinciding Zero Forcing number and Maximum Nullity
We study the minimum rank of a (simple, undirected) graph, which is the minimum rank among all matrices in a space determined by the graph.
Combinatorics 05C50
Accelerating Newton-Schulz Iteration for Orthogonalization via Chebyshev-type Polynomials
grishkate/accelerating_orthogonalization
•
•
The problem of computing optimal orthogonal approximation to a given matrix has attracted growing interest in machine learning.
Numerical Analysis Numerical Analysis 65F25, 65F60, 53Z50, 68W25
Analysis of Floating-Point Matrix Multiplication Computed via Integer Arithmetic
We perform a range of numerical experiments, both in simulation and on the latest NVIDIA GPUs, that confirm the analysis and illustrate strengths and weaknesses of the algorithm.
Numerical Analysis Mathematical Software Numerical Analysis 65F99, 65G50, 65Y10
On a conjecture of Faudree and Schelp
In 1978 Thomassen constructed a (non-cubic and non-planar) family of counterexamples, showing that there exist hamiltonian-connected $n$-vertex graphs containing two vertices with no path of length $n-2$ between them.
Combinatorics
