English
Related papers

Related papers: Pretentiously detecting power cancellation

200 papers

Feature selection has attracted significant attention in data mining and machine learning in the past decades. Many existing feature selection methods eliminate redundancy by measuring pairwise inter-correlation of features, whereas the…

Machine Learning · Computer Science 2015-02-03 Zhijun Chen , Chaozhong Wu , Yishi Zhang , Zhen Huang , Bin Ran , Ming Zhong , Nengchao Lyu

We start to investigate how small changes on the definition of ordinary means affect their properties. Especially the property of being a mean. In that direction we are looking for weakenings of the basic defining property of means. Hence…

General Mathematics · Mathematics 2021-12-22 Attila Losonczi

The notion of distortion in social choice problems has been defined to measure the loss in efficiency -- typically measured by the utilitarian social welfare, the sum of utilities of the participating agents -- due to having access only to…

Computer Science and Game Theory · Computer Science 2021-03-02 Elliot Anshelevich , Aris Filos-Ratsikas , Nisarg Shah , Alexandros A. Voudouris

The classical conception of falsification presents scientific theories as entities that are decisively refuted when their predictions fail. This picture has long been challenged by both philosophical analysis and scientific practice, yet…

Other Statistics · Statistics 2025-12-09 Tommaso Costa

Anomalous cancellation of fractions is a mathematically inaccurate method where cancelling the common digits of the numerator and denominator correctly reduces it. While it appears to be accidentally successful, the property of anomalous…

History and Overview · Mathematics 2025-06-18 Satvik Saha , Sohom Gupta , Sayan Dutta , Sourin Chatterjee

We find all factorized duality functions for a class of interacting particle systems. The functions we recover are self-duality functions for interacting particle systems such as zero-range processes, symmetric inclusion and exclusion…

Probability · Mathematics 2018-08-01 Frank Redig , Federico Sau

We establish effective mean-value estimates for a wide class of multiplicative arithmetic functions, thereby providing (essentially optimal) quantitative versions of Wirsing's classical estimates and extending those of Hal\'asz. Several…

Number Theory · Mathematics 2025-07-23 Gérald Tenenbaum

We shed doubt on a commonly used manipulation in computing the partition function for a matrix valued operator together with its attendant invocation of the multiplicative anomaly.

High Energy Physics - Theory · Physics 2007-05-23 J. S. Dowker

We show that if an exponential sum with multiplicative coefficients is large then the associated multiplicative function is "pretentious". This leads to applications in the circle method, and a natural interpretation of the local-global…

Number Theory · Mathematics 2021-04-01 Régis de la Bretèche , Andrew Granville

A choice of optimization objective is immensely pivotal in the design of a recommender system as it affects the general modeling process of a user's intent from previous interactions. Existing approaches mainly adhere to three categories of…

Machine Learning · Computer Science 2024-08-02 Hyunsoo Chung , Jungtaek Kim , Hyungeun Jo , Hyungwon Choi

In this paper, by using a general result on the monotonicity of quotients of power series, our aim is to prove some monotonicity and convexity results for the modified Struve functions. Moreover, as consequences of the above mentioned…

Classical Analysis and ODEs · Mathematics 2014-10-15 Árpád Baricz , Tibor K. Pogány

We investigate the computational properties of basic mathematical notions pertaining to $\mathbb{R}\rightarrow \mathbb{R}$-functions and subsets of $\mathbb{R}$, like finiteness, countability, (absolute) continuity, bounded variation,…

Logic · Mathematics 2024-08-15 Dag Normann , Sam Sanders

We combine the concepts of modal logics and many-valued logics in a general and comprehensive way. Namely, given any finite linearly ordered set of truth values and any set of propositional connectives defined by truth tables, we define the…

Logic in Computer Science · Computer Science 2025-01-03 Amir Karniel , Michael Kaminski

The usual nonnegative modulus function is based on addition. A natural different modulus function on the set of positive reals is introduced. Arguments for results for series through the usual modulus function are transformed to arguments…

General Mathematics · Mathematics 2019-12-10 C. Ganesa Moorthy

Interestingness is an important criterion by which we judge knowledge discovery. But, interestingness has escaped all attempts to capture its intuitive meaning into a concise and comprehensive form. A unifying paradigm is formulated by…

Information Retrieval · Computer Science 2014-04-03 Iaakov Exman

The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the…

Logic in Computer Science · Computer Science 2010-12-02 David Baelde

We extend the work of Narasimhan and Bilmes [30] for minimizing set functions representable as a difference between submodular functions. Similar to [30], our new algorithms are guaranteed to monotonically reduce the objective function at…

Data Structures and Algorithms · Computer Science 2013-08-27 Rishabh Iyer , Jeff Bilmes

Let $\pi$ be an irreducible unitary representation of a finitely generated nonabelian free group $\Gamma$; suppose $\pi$ is weakly contained in the regular representation. In 2001 the first and third authors conjectured that such a…

Representation Theory · Mathematics 2020-10-14 M. Gabriella Kuhn , Sandra Saliani , Tim Steger

Let $f:\mathbb{N}\to \mathbb{D}$ be a multiplicative function. Under the merely necessary assumption that $f$ is non-pretentious (in the sense of Granville and Soundararajan), we show that for any pair of distinct integer shifts $h_1,h_2$…

Number Theory · Mathematics 2023-05-29 Oleksiy Klurman , Alexander P. Mangerel , Joni Teräväinen

It is quite well-known from Kurt Godel's (1931) ground-breaking result on the Incompleteness Theorem that rudimentary relations (i.e., those definable by bounded formulae) are primitive recursive, and that primitive recursive functions are…

Logic · Mathematics 2021-11-30 Saeed Salehi