Related papers: Proof of Irvine's Conjecture via Mechanized Guessi…

Inversion theorems of Wiener type are essential tools in analysis and number theory. We derive a weighted version of an inversion theorem of Wiener type for general Dirichlet series from that of Edwards from 1957, and we outline an…

We study the Carnot theorem and the configuration of points and lines in connection with it. It is proven that certain significant points in the configuration lie on the same lines and same conics. The proof of an equivalent statement…

We prove a strengthened form of a conjecture of Sun on a determinant attached to a binary quadratic form. Let $n>3$ and let $c,d\in\Z$. If $n$ is composite, then \[ \det\big[(i^2+cij+dj^2)^{n-2}\big]_{0\leq i,j\leq n-1}\equiv 0\pmod {n^2}…

Biological visual systems exhibit abundant recurrent connectivity. State-of-the-art neural network models for visual recognition, by contrast, rely heavily or exclusively on feedforward computation. Any finite-time recurrent neural network…

Mason's Conjecture asserts that for an $m$--element rank $r$ matroid $\M$ the sequence $(I_k/\binom{m}{k}: 0\leq k\leq r)$ is logarithmically concave, in which $I_k$ is the number of independent $k$--sets of $\M$. A related conjecture in…

We prove a stronger version of Jarden's Theorem for recurrence of powers of recursive functions

Much of the recent research on solving iterative inference problems focuses on moving away from hand-chosen inference algorithms and towards learned inference. In the latter, the inference process is unrolled in time and interpreted as a…

An technically interesting proof of a known theorem.

Recently N. Levin (Comp. Math. 127 (2001), 1--21) proved the Tate conjecture for ordinary cubic fourfolds over finite fields. In this paper we prove the Tate conjecture for self-products of ordinary cubic fourfolds. Our proof is based on…

We propose introspective convolutional networks (ICN) that emphasize the importance of having convolutional neural networks empowered with generative capabilities. We employ a reclassification-by-synthesis algorithm to perform training…

The theory of Weil-Stark elements is used to develop an axiomatic approach to the formulation of refined versions of Stark's Conjecture. This gives concrete new results concerning leading terms of Artin $L$-series and arithmetic properties…

We present a different proof of the characterization of non--degenerate recurrence sequences, which are also divisibility sequences, given by Van der Poorten, Bezevin, and Petho in their paper "A Full Characterisation of Divisibility…

The theory of noninterference supports the analysis of secure computations in multi-level security systems. Classical equivalence-based approaches to noninterference mainly rely on bisimilarity. In a nondeterministic setting, assessing…

A certain mathematician M, considering some hypothesis H, conclusion C and text P, can arrive at one of the following judgments: (1) P does not convince M of the fact that since H, it follows that C; (2) P is the proof that since H, it…

We prove Carlos Simpson's "semi-strictification" (or "weak unit") conjecture in the case of infinity-groupoids. More precisely, we introduce two precise versions of the conjecture, the "general" and the "regular" conjecture, involving two…

A proof for a conjecture by Shadrin and Zvonkine, relating the entries of a matrix arising in the study of Hurwitz numbers to a certain sequence of rational numbers, is given. The main tools used are iteration matrices of formal power…

We conjecture that the exceptional set in Manin's Conjecture has an explicit geometric description. Our proposal includes the rational point contributions from any generically finite map with larger geometric invariants. We prove that this…

We provide self-contained proof of a theorem relating probabilistic coherence of forecasts to their non-domination by rival forecasts with respect to any proper scoring rule. The theorem appears to be new but is closely related to results…

We give a short proof of Theorem 2.1 from [MR07], stating that the linearly edge reinforced random walk (ERRW) on a locally finite graph is recurrent if and only if it returns to its starting point almost surely. This result was proved in…

Ron Graham's Sequence is a surprising bijection from non-negative integers to non-negative, non-prime integers that was introduced by Ron Graham in the June 1986 "Problems" column of $\textit{Mathematics Magazine}$, and which later appeared…