English
Related papers

Related papers: On a generalization of property B

200 papers

In this paper, we introduce a new generalization of the perfect numbers, called $\mathcal{S}$-perfect numbers. Briefly stated, an $\mathcal{S}$-perfect number is an integer equal to a weighted sum of its proper divisors, where the weights…

Number Theory · Mathematics 2025-12-05 Tyler Ross

We revisit the problem of general identifiability originally introduced in [Lee et al., 2019] for causal inference and note that it is necessary to add positivity assumption of observational distribution to the original definition of the…

Machine Learning · Computer Science 2022-06-03 Yaroslav Kivva , Ehsan Mokhtarian , Jalal Etesami , Negar Kiyavash

Uniform interpolation property (UIP) is a strengthening of Craig interpolation property. It was first established by Pitts(1992) based on a pure proof-theoretic method. UIP in multi-modal $\mathbf{K_n}$, $\mathbf{KD_n}$ and $\mathbf{KT_n}$…

Logic in Computer Science · Computer Science 2025-10-30 Youan Su

This article is motivated by the following satisfiability question: pick uniformly at random an and/or Boolean expression of length n, built on a set of k_n Boolean variables. What is the probability that this expression is satisfiable?…

Combinatorics · Mathematics 2015-07-31 Antoine Genitrini , Cécile Mailler

We address the problem of learning human-interpretable descriptions of a complex system from a finite set of positive and negative examples of its behavior. In contrast to most of the recent work in this area, which focuses on descriptions…

Machine Learning · Computer Science 2020-02-11 Rajarshi Roy , Dana Fisman , Daniel Neider

In this article, we introduce the concept of the column-sufficient W-property for a set of matrices and prove the convexity of the solution set for the Extended Horizontal Linear Complementarity Problem. Additionally, we present an…

Optimization and Control · Mathematics 2025-04-30 Punit Kumar Yadav , K. Palpandi

Generalised Satisfiability Problems (or Boolean Constraint Satisfaction Problems), introduced by Schaefer in 1978, are a general class of problem which allow the systematic study of the complexity of satisfiability problems with different…

Computational Complexity · Computer Science 2008-09-11 John Faben

We develop a technique for normalization for $\infty$-type theories. The normalization property helps us to prove a coherence theorem: the initial model of a given $\infty$-type theory is $0$-truncated. The coherence theorem justifies…

Logic · Mathematics 2022-12-23 Taichi Uemura

We present an analogue of the differential calculus in which the role of polynomials is played by certain ordered sets and trees. Our combinatorial calculus has all nice features of the usual calculus and has an advantage that the elements…

Combinatorics · Mathematics 2007-08-28 Artur Jez , Piotr Sniady

We prove a generalization of the polarization identity of linear algebra expressing the inner product of a complex inner product space in terms of the norm, where the field of scalars is extended to an associative algebra equipped with an…

Rings and Algebras · Mathematics 2023-02-07 Chase Bender , Debraj Chakrabarti

Using the Laplace derivative a Perron type integral, the Laplace integral, is defined. Moreover, it is shown that this integral includes Perron integral and to show that the inclusion is proper, an example of a function is constructed,…

Classical Analysis and ODEs · Mathematics 2021-06-08 S. Mahanta , S. Ray

We describe a general method for verifying inequalities between real-valued expressions, especially the kinds of straightforward inferences that arise in interactive theorem proving. In contrast to approaches that aim to be complete with…

Mathematical Software · Computer Science 2016-01-05 Jeremy Avigad , Robert Y. Lewis , Cody Roux

In 1973, I. M. Isaacs described a correspondence between characters of degree not divisible by a fixed prime $p$ of a finite solvable group $G$ and those of the normalizer of Sylow $p$-subgroup of $G$, whenever the index of the normalizer…

Representation Theory · Mathematics 2019-09-10 Carolina Vallejo

In this paper we explore the representation property over sets. This property generalizes constructibility, however is weak enough to enable us to prove that the class of theories $T$ whose models are representable is exactly the class of…

Logic · Mathematics 2009-06-18 Moran Cohen , Saharon Shelah

The following natural question arises from Shalom's innovational work (1999, Publ. IHES): "Can we establish an intrinsic criterion to synthesize relative fixed point properties into the whole fixed point property without assuming Bounded…

Group Theory · Mathematics 2016-11-16 Masato Mimura

The endowment effect, coined by Nobel Laureate Richard Thaler, posits that people tend to inflate the value of items they own. This bias was studied, both theoretically and empirically, with respect to a single item. Babaioff et al. [EC'18]…

Computer Science and Game Theory · Computer Science 2019-11-12 Tomer Ezra , Michal Feldman , Ophir Friedler

In this article, we derive a congruence property of particular sum rules involving prime numbers. The resulting expression involves Bernoulli numbers and polynomials, for which we obtain, as a consequence, a general congruence relation as…

History and Overview · Mathematics 2025-02-10 Jean-Christophe Pain

This paper introduces a general construction of self-similar metric spaces as limits of discrete graphs. Our framework produces many classical examples, such as the Sierpi\'nski carpet and the higher dimensional Menger sponges, but also a…

Metric Geometry · Mathematics 2025-10-16 Riku Anttila , Sylvester Eriksson-Bique

We establish a new spectral criterion for Kazhdan's property $(T)$ which is applicable to a large class of discrete groups defined by generators and relations. As the main application, we prove property $(T)$ for the groups $EL_n(R)$, where…

Group Theory · Mathematics 2009-12-21 Mikhail Ershov , Andrei Jaikin-Zapirain

In the last chapter of his book "The Algebraic Theory of Modular Systems " published in 1916, F. S. Macaulay developped specific techniques for dealing with " unmixed polynomial ideals " by introducing what he called " inverse systems ".…

Analysis of PDEs · Mathematics 2012-12-21 Jean-François Pommaret
‹ Prev 1 8 9 10 Next ›