Related papers: Remarks on NIP in a model

The AHP/ANP are multicriteria decision-making theories that deal with both hierarchic structures when the criteria are independent of the alternatives and with networks when there is any dependence within and between elements of the…

Any non-abelian finite $p$-group has a non-inner automorphism of order $p$.

We introduce an axiomatization for the notion of computation. Based on the idea of Brouwer choice sequences, we construct a model, denoted by $E$, which satisfies our axioms and $E \models \mathrm{ P \neq NP}$. In other words, regarding…

For a real number $x$ and set of natural numbers $A$, define $x \ast A := \{ x a \bmod 1: a\in A\}\subseteq [0,1).$ We consider relationships between $x$, $A$, and the order-type of $x\ast A$. For example, for every irrational $x$ and…

Here I discuss ideas that makes a synthesis of topology and probability theory. The idea is the following: given a set $X$, assign a number $p(A)\in [0,1]$ for any subset $A$ of $X$. We can interpret $p(A)$ as the probability of openness of…

Model counting is the task of computing the number of assignments to variables V that satisfy a given propositional theory F. Model counting is an essential tool in probabilistic reasoning. In this paper, we introduce the problem of model…

In this paper we give a new semiprimality test and we construct a new formula for $\pi ^{(2)}(N)$, the function that counts the number of semiprimes not exceeding a given number $N$. We also present new formulas to identify the $n^{th}$…

There are things we know, things we know we don't know, and then there are things we don't know we don't know. In this paper we address the latter two issues in a Bayesian framework, introducing the notion of doubt to quantify the degree of…

We will give new upper bounds for the number of solutions to the inequalities of the shape $|F(x , y)| \leq h$, where $F(x , y)$ is a sparse binary form, with integer coefficients, and $h$ is a sufficiently small integer in terms of the…

One of the enduring problems surrounding neural networks is to identify the factors that differentiate them from traditional statistical models. We prove a pair of results which distinguish feedforward neural networks among parametric…

Rule-based modelers dislike direct enumeration of cases when more efficient means of enumeration are available. We present an extension of the Kappa language which attaches to agents a notion of level. We detail two encodings that are more…

In this paper we give a summary of the comparisons between different definitions of so-called (\infty,1)-categories, which are considered to be models for \infty-categories whose n-morphisms are all invertible for n>1. They are also, from…

This paper provides a full characterization for when the expansion of a complete o-minimal theory by a unary predicate that picks out a divisible dense and codense subgroup has a model companion. This result is motivated by criteria and…

We introduce a framework for reasoning about what meaning is captured by the neurons in a trained neural network. We provide a strategy for discovering meaning by training a second model (referred to as an observer model) to classify the…

We introduce a new model of competition on growing networks. This extends the preferential attachment model, with the key property that node choices evolve simultaneously with the network. When a new node joins the network, it chooses…

A series of examples of computational models is provided, where the model aim is to interpret numerical results in terms of internal states of agents minds. Two opposite strategies or research can be distinguished in the literature. First…

We show that every countable cograph has either one or infinitely many siblings. This answers, very partially, a conjecture of Thomass\'e. The main tools are the notion of well quasi ordering and the correspondence between cographs and some…

Let M be the ideal of first category subsets of R and non(M)=min{card X: X \subseteq R, X \not\in M}. We consider families \Phi of sequences converging to \infty, with the property that for every open set U \subseteq R that is unbounded…

The nonnegative inverse eigenvalue problem (NIEP) asks which lists of $n$ complex numbers (counting multiplicity) occur as the eigenvalues of some $n$-by-$n$ entry-wise nonnegative matrix. The NIEP has a long history and is a known hard…

We show that the notion of $(\infty,n)$-limit defined using the enriched approach and the one defined using the internal approach coincide. We also give explicit constructions of various double $(\infty,n-1)$-categories implementing various…