English
Related papers

Related papers: Comparing DNR and WWKL

200 papers

Let $p$ be a fixed prime number, and $N$ be a large integer. The 'Inverse Conjecture for the Gowers norm' states that if the "$d$-th Gowers norm" of a function $f:\F_p^N \to \F_p$ is non-negligible, that is larger than a constant…

Combinatorics · Mathematics 2008-10-20 Shachar Lovett , Roy Meshulam , Alex Samorodnitsky

Weighted low-rank approximation (WLRA), a dimensionality reduction technique for data analysis, has been successfully used in several applications, such as in collaborative filtering to design recommender systems or in computer vision to…

Optimization and Control · Mathematics 2012-08-13 Nicolas Gillis , François Glineur

We verify conjecture 5.11 of Panyushev [\emph{Antichains in weight posets associated with gradings of simple Lie algebras}, Math Z 281(3):1191--1214, 2015].

Representation Theory · Mathematics 2015-12-08 Chao-Ping Dong

This paper studies chemical kinetic systems which decompose into weakly reversible complex factorizable (CF) systems. Among power law kinetic systems, CF systems (denoted as PL-RDK systems) are those where branching reactions of a reactant…

Dynamical Systems · Mathematics 2022-03-08 Bryan S. Hernandez , Eduardo R. Mendoza

We study the logical and computational properties of basic theorems of uncountable mathematics, in particular Pincherle's theorem, published in 1882. This theorem states that a locally bounded function is bounded on certain domains, i.e.…

Logic · Mathematics 2020-02-03 Dag Normann , Sam Sanders

A set C of reals is said to be negligible if there is no probabilistic algorithm which generates a member of C with positive probability. Various classes have been proven to be negligible, for example the Turing upper-cone of a…

Logic · Mathematics 2016-10-19 Laurent Bienvenu , Ludovic Patey

A function from sequences to their subsequences is called selection function. A selection function is called admissible (with respect to normal numbers) if for all normal numbers, their subsequences obtained by the selection function are…

Information Theory · Computer Science 2011-02-17 Hayato Takahashi

Let $f :\R\to\R$ be a continuous function. We prove that under some additional assumptions on $f$ and $A:\R\to\R_{+}$, weak $\Cuno$ solutions of the differential inequality $-\diver(A(\abs{\nabla u})\nabla u)\ge f(u)$ on $\RN$ are…

Analysis of PDEs · Mathematics 2015-05-19 Lorenzo D'Ambrosio , Enzo Mitidieri

Following a result of Bennewitz-Lewis for non-doubling harmonic measure, we prove a criterion for non-doubling caloric measure to satisfy a weak reverse Holder inequality on an open set $\Omega$, assuming as a background hypothesis only…

Analysis of PDEs · Mathematics 2022-02-01 Alyssa Genschaw , Steve Hofmann

Dunkl operators are differential-difference operators parametrized by a finite reflection group and a weight function. The commutative algebra generated by these operators generalizes the algebra of standard differential operators and…

Functional Analysis · Mathematics 2016-05-12 Mostafa Maslouhi

Let $R$ be a ring. An $R$-module $M$ is said to be a weak $w$-projective module if ${\rm Ext}_R^1(M,N)=0$ for all $N \in \mathcal{P}_{w}^{\dagger_\infty}$ (see, \cite{FLQ}). In this paper, we introduce and study some properties of weak…

Commutative Algebra · Mathematics 2023-01-03 Refat Abdelmawla Khaled Assaad

Deep Neural Networks (DNNs) have been shown to be vulnerable to adversarial examples. While numerous successful adversarial attacks have been proposed, defenses against these attacks remain relatively understudied. Existing defense…

Machine Learning · Computer Science 2025-06-17 Furkan Mumcu , Yasin Yilmaz

Chemical reaction networks, or CRNs, are known to stably compute semilinear Boolean-valued predicates and functions, provided that all reactions are irreversible. However, this property does not hold for wet-lab implementations, as all…

Computational Complexity · Computer Science 2026-04-17 Ravi Kini , David Doty

Difference Logic (DL) is a fragment of linear arithmetics where atoms are constraints x+k <= y for variables x,y (ranging over Q or Z) and integer k. We study the complexity of deciding the truth of existential DL sentences. This problem…

Data Structures and Algorithms · Computer Science 2024-02-06 Konrad K. Dabrowski , Peter Jonsson , Sebastian Ordyniak , George Osipov

The notion of well order admits an alternative definition in terms of embeddings between initial segments. We use the framework of reverse mathematics to investigate the logical strength of this definition and its connection with…

Logic · Mathematics 2023-04-07 Anton Freund , Davide Manca

A compact space is said to be weakly Radon-Nikod\'{y}m (WRN) if it can be weak*-embedded into the dual of a Banach space not containing $\ell_1$. We investigate WRN Boolean algebras, i.e. algebras whose Stone space is WRN compact. We show…

Functional Analysis · Mathematics 2016-10-17 Antonio Avilés , Gonzalo Martínez-Cervantes , Grzegorz Plebanek

Recent work by Lakshminarayanan and Singh [2020] provided a dual view for fully connected deep neural networks (DNNs) with rectified linear units (ReLU). It was shown that (i) the information in the gates is analytically characterised by a…

Machine Learning · Computer Science 2022-03-31 Chandrashekar Lakshminarayanan , Amit Vikram Singh , Arun Rajkumar

It is shown that $u_k \cdot v_k$ converges weakly to $u\cdot v$ if $u_k\weakto u$ weakly in $L^p$ and $v_k\weakly v$ weakly in $L^q$ with $p, q\in (1,\infty)$, $1/p+1/q=1$, under the additional assumptions that the sequences $\Div u_k$ and…

Analysis of PDEs · Mathematics 2018-05-01 Sergio Conti , Georg Dolzmann , Stefan Müller

Contemporary wisdom based on empirical studies suggests that standard recurrent neural networks (RNNs) do not perform well on tasks requiring long-term memory. However, precise reasoning for this behavior is still unknown. This paper…

Machine Learning · Computer Science 2021-01-21 Melikasadat Emami , Mojtaba Sahraee-Ardakan , Parthe Pandit , Sundeep Rangan , Alyson K. Fletcher

A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…

Combinatorics · Mathematics 2026-05-26 Guy Moshkovitz , Dora Woodruff
‹ Prev 1 8 9 10 Next ›