Concept
Uplet
Publications associées (10)
Succinct ordering and aggregation constraints in algebraic array theories
We discuss two extensions to a recently introduced theory of arrays, which are based on considerations coming from the model theory of power structures. First, we discuss how the ordering relation on the index set can be expressed succinctly by referring t ...
Elsevier Science Inc2024On the Density of Coprime Tuples of the Form (n, ⌊f1(n)⌋, …, ⌊fk(n)⌋), Where f_1, …, f_k Are Functions from a Hardy Field
Let k∈Nk∈Nk \in \mathbb{N} and let f1, …, f k belong to a Hardy field. We prove that under some natural conditions on the k-tuple ( f1, …, f k ) the density of the set {n∈N:gcd(n,⌊f1(n)⌋,…,⌊fk(n)⌋)=1}{n∈N:gcd(n,⌊f1(n)⌋,…,⌊fk(n)⌋)=1}\displaystyle{\big{n \i ...
Springer International Publishing2017A Polynomial Regularity Lemma For Semialgebraic Hypergraphs And Its Applications In Geometry And Property Testing
In this paper, we prove several extremal results for geometrically defined hypergraphs. In particular, we establish an improved lower bound, single exponentially decreasing in k, on the best constant delta > 0 such that the vertex classes P-1,...,P-k of ev ...
Society for Industrial and Applied Mathematics2016Maximizing k-Submodular Functions and Beyond
We consider the maximization problem in the value oracle model of functions defined on k-tuples of sets that are submodular in every orthant and r-wise monotone, where k >= 2 and 1
Assoc Computing Machinery2016Ramsey-Type Results For Semi-Algebraic Relations
A k-ary semi-algebraic relation E on R-d is a subset of R-kd, the set of k-tuples of points in R-d, which is determined by a finite number of polynomial inequalities in kd real variables. The description complexity of such a relation is at most t if d, k < ...
Amer Mathematical Soc2014Ramsey-type results for semi-algebraic relations
A k-ary semi-algebraic relation E on R^d is a subset of R^{kd}, the set of k-tuples of points in R^d, which is determined by a finite number of polynomial equations and inequalities in kd real variables. The description complexity of such a relation is at ...
2013Representing Guard Dependencies in Dataflow Execution Traces
Marco Mattavelli, Simone Casale Brunet, Claudio Paolo Alberti
Heterogeneous parallel systems are becoming mainstream computing platforms nowadays. One of the main challenges the development community is currently facing is how to fully exploit the available computational power when porting existing programs or develo ...
IEEE2013Causality in Databases
Provenance is often used to validate data, by verifying its origin and explaining its derivation. When searching for “causes” of tuples in the query results or in general observations, the analysis of lineage becomes an essential tool for providing such ju ...
2010ON THE INEQUALITIES IN INFORMATION THEORY
Claude Elwood Shannon in 1948, then of the Bell Labs, published one of the ground breaking papers in the history of engineering [1]. This paper (”A Mathematical Theory of Communication”, Bell System Tech. Journal, Vol. 27, July and October 1948, pp. 379 - ...
2007