English
Related papers

Related papers: A wild model of linear arithmetic and discretely o…

200 papers

Let $T$ be a consistent o-minimal theory extending the theory of densely ordered groups and let $T'$ be a consistent theory. Then there is a complete theory $T^*$ extending $T$ such that $T$ is an open core of $T^*$, but every model of…

Logic · Mathematics 2017-10-10 Philipp Hieronymi , Travis Nell , Erik Walsberg

Let $L$ be a free Lie algebra over a field $k$, $I$ a non-trivial proper ideal of $L$, $n>1$ an integer. The multiplicator $H_2(L/I^n,k)$ of $L/I^n$ is not finitely generated, and so in particular, $L/I^n$ is not finitely presented, even…

Group Theory · Mathematics 2009-09-25 Joseph Abarbanel , Shmuel Rosset

We continue developing the theory around the twin-width of totally ordered binary structures, initiated in the previous paper of the series. We first introduce the notion of parity and linear minors of a matrix, which consists of…

Data Structures and Algorithms · Computer Science 2022-09-27 Édouard Bonnet , Ugo Giocanti , Patrice Ossona de Mendez , Stéphan Thomassé

Given any two rational numbers $r_1$ and $r_2$, a necessary and sufficient condition is established for the three numbers $1$, $\cos (\pi r_1)$, and $\cos (\pi r_2)$ to be rationally independent. Extending a classical fact sometimes…

Number Theory · Mathematics 2015-04-28 Arno Berger

The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabilities via product of parameters are shown to capture…

Artificial Intelligence · Computer Science 2012-06-18 Ydo Wexler , Christopher Meek

Suppose that f is a function from Z_p -> [0,1] (Z_p is my notation for the integers mod p, not the p-adics), and suppose that a_1,...,a_k are some places in Z_p. In some additive number theory applications it would be nice to perturb f…

Combinatorics · Mathematics 2007-07-31 Ernie Croot

We show that every unstable NIP theory admits a V-definable linear quasi-order, over a finite set of parameters. In particular, if the theory is omega-categorical, then it interprets an infinite linear order. This partially answers a…

Logic · Mathematics 2021-07-02 Pierre Simon

Linear Predictive Clustering (LPC) partitions samples based on shared linear relationships between feature and target variables, with numerous applications including marketing, medicine, and education. Greedy optimization methods, commonly…

Machine Learning · Computer Science 2026-04-08 Jiazhou Liang , Hassan Khurram , Scott Sanner

Let ${\mathcal C}= \bigcup_{i=1}^n C_i \subseteq \mathbb{P}^2$ be a collection of smooth rational plane curves. We prove that the addition-deletion operation used in the study of hyperplane arrangements has an extension which works for a…

Commutative Algebra · Mathematics 2012-01-31 Hal Schenck , Stefan O. Tohaneanu

We introduce two-sorted theories in the style of [CN10] for the complexity classes \oplusL and DET, whose complete problems include determinants over Z2 and Z, respectively. We then describe interpretations of Soltys' linear algebra theory…

Logic in Computer Science · Computer Science 2015-07-01 Stephen A Cook , Lila A Fontes

Monadic decomposability is a notion of variable independence, which asks whether a given formula in a first-order theory is expressible as a Boolean combination of monadic predicates in the theory. Recently, Veanes et al. showed the…

Logic in Computer Science · Computer Science 2020-04-28 Matthew Hague , Anthony Widjaja Lin , Philipp Rümmer , Zhilin Wu

We study the projective systems in both continuous and discrete settings. These systems are linearizable by construction and thus, obviously, integrable. We show that in the continuous case it is possible to eliminate all variables but one…

solv-int · Physics 2015-06-26 S. Lafortune , B. Grammaticos , A. Ramani

In introductory books about natural numbers, a common kind of assertion - often left as exercise to the reader - is that certain forms of induction on $\mathbb{N}$ (regular/ordinary, complete/strong) are equivalent one to each other and to…

Logic · Mathematics 2021-11-23 João Alves Silva Júnior

In continuous logic, there are plenty of examples of interesting stable metric structures. However, on the other side of the SOP line, there are only a few metric structures where order is relevant, and orders often appear in different…

Logic · Mathematics 2025-10-15 Aaron Anderson , Diego Bejarano

The purpose of this review paper is to present our recent results on nonlinear and nonlocal mathematical models arising from modern financial mathematics. It is based on our four papers written jointly by J. Cruz, M. Grossinho, D. Sevcovic,…

Mathematical Finance · Quantitative Finance 2022-07-26 Jose Cruz , Maria Grossinho , Daniel Sevcovic , Cyril Izuchukwu Udeani

Throughout the course of mathematical history, generalizations of previously understood concepts and structures have led to the fruitful development of the hierarchy of number systems, non-euclidean geometry, and many other epochal phases…

Logic · Mathematics 2013-11-26 Samuel Reid

"Clarithmetic" is a generic name for formal number theories similar to Peano arithmetic, but based on computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html) instead of the more traditional classical or intuitionistic logics.…

Logic in Computer Science · Computer Science 2011-08-24 Giorgi Japaridze

In this paper, we present a new method for estimating the $L_2$-gain of systems governed by 2nd order linear Partial Differential Equations (PDEs) in two spatial variables, using semidefinite programming. It has previously been shown that,…

Optimization and Control · Mathematics 2024-06-18 Declan S. Jagt , Matthew M. Peet

A statistical model is a mathematical representation of an often simplified or idealised data-generating process. In this paper, we focus on a particular type of statistical model, called linear mixed models (LMMs), that is widely used in…

Methodology · Statistics 2020-01-23 Emi Tanaka , Francis K. C. Hui

Nominalistic Logic (NL) is a new presentation of Paul Gilmore's Intensional Type Theory (ITT) as a sequent calculus together with a succinct nominalization axiom (N) that permits names of predicates as individuals in certain cases. The…

Logic in Computer Science · Computer Science 2008-12-31 Jørgen Villadsen