Related papers: Effective Disjunction and Effective Interpolation …
The inference of an underlying network topology from local observations of a complex system composed of interacting units is usually attempted by using statistical similarity measures, such as Cross-Correlation (CC) and Mutual Information…
We give a direct, purely arithmetical and elementary proof of the strong normalization of the cut-elimination procedure for full (i.e. in presence of all the usual connectives) classical natural deduction.
A pure pair in a graph $G$ is a pair $A,B$ of disjoint subsets of $V(G)$ such that $A$ is complete or anticomplete to $B$. Jacob Fox showed that for all $\epsilon>0$, there is a comparability graph $G$ with $n$ vertices, where $n$ is large,…
This article presents a reformulation of the Theory of Functional Connections: a general methodology for functional interpolation that can embed a set of user-specified linear constraints. The reformulation presented in this paper exploits…
It is crucial for auditory attention decoding to classify matched and mismatched speech stimuli with corresponding EEG responses by exploring their relationship. However, existing methods often adopt two independent networks to encode…
Basic experimental facts related to ARPES, tunnelling, optics ad neutron scattering measurements are discussed. They give evidence for the relevance of the electron-phonon interaction (EPI) in pairing mechanism of HTSC cuprates. A…
For a continuous flow on a compact metric space, the aim of this paper is to prove a Conley-type decomposition of the strong chain recurrent set. We first discuss in details the main properties of strong chain recurrent sets. We then…
In this paper we study the stability of explicit finite difference discretizations of linear advection-diffusion equations (ADE) with arbitrary order of accuracy in the context of method of lines. The analysis first focuses on the stability…
The possible functional forms of the effective conductivity sigma_{eff} of the randomly inhomogeneous two-phase system at arbitrary values of concentrations are discussed. A new functional equation, generalizing the duality relation, is…
Generalizing the notion of a tight almost disjoint family, we introduce the notions of a {\em tight eventually different} family of functions in Baire space and a {\em tight eventually different set of permutations} of $\omega$. Such sets…
A subset of a discrete group $G$ is called completely Sidon if its span in $C^*(G)$ is completely isomorphic to the operator space version of the space $\ell_1$ (i.e. $\ell_1$ equipped with its maximal operator space structure). We recently…
In this paper, we present an Adaptive Ensemble Learning framework that aims to boost the performance of deep neural networks by intelligently fusing features through ensemble learning techniques. The proposed framework integrates ensemble…
Statistical discoveries are often obtained through multiple hypothesis testing. A variety of procedures exists to evaluate multiple hypotheses, for instance the ones of Benjamini-Hochberg, Bonferroni, Holm or Sidak. We are particularly…
This review gives an overview of effective field theory (EFT) as applied at finite density, with a focus on nuclear many-body systems. Uniform systems with short-range interactions illustrate the ingredients and virtues of many-body EFT and…
When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…
The uniform Kruskal theorem extends the original result for trees to general recursive data types. As shown by A. Freund, M. Rathjen and A. Weiermann, it is equivalent to $\Pi^1_1$-comprehension, over $\mathsf{RCA_0}$ with the chain…
It is demonstrated that SC mechanism of doped Fe-based compounds is characteristic for itinerant electron systems with coexistence of both (e-e)- and (e-h)-pairing arising due to electron-phonon and Coulomb interactions, respectively. The…
A 3-graph $\mathcal{F}$ is \emph{$U(s, 2s+1)$} if for any $s$ edges $e_1,...,e_s\in E(\mathcal{F})$, $|e_1\cup...\cup e_s|\leq 2s+1$. Frankl and Kupavskii (2020) proposed the following conjecture: For any $3$-graph $\mathcal{F}$ with $n$…
Let $A\in\mathbb{R}^{n\times n}$ be a random matrix with independent entries, and suppose that the entries are "uniformly anticoncentrated" in the sense that there is a constant $\varepsilon>0$ such that each entry $a_{ij}$ satisfies…
We devise a framework for proving tight lower bounds under the counting exponential-time hypothesis #ETH introduced by Dell et al. (ACM Transactions on Algorithms, 2014). Our framework allows us to convert classical #P-hardness results for…