English
Related papers

Related papers: A Bisimulation-Invariance-Based Approach to the Se…

200 papers

Recent work has shown that not only decision trees (DTs) may not be interpretable but also proposed a polynomial-time algorithm for computing one PI-explanation of a DT. This paper shows that for a wide range of classifiers, globally…

Artificial Intelligence · Computer Science 2021-06-24 Xuanxiang Huang , Yacine Izza , Alexey Ignatiev , Joao Marques-Silva

The proposal and study of dependent prior processes has been a major research focus in the recent Bayesian nonparametric literature. In this paper, we introduce a flexible class of dependent nonparametric priors, investigate their…

Statistics Theory · Mathematics 2014-07-03 Antonio Lijoi , Bernardo Nipoti , Igor Prünster

For a relative effective divisor $\mathcal{C}$ on a smooth projective family of surfaces $q:\mathcal{S}\rightarrow B$, we consider the locus in $B$ over which the fibres of $\mathcal{C}$ are $\delta$-nodal curves. We prove a conjecture by…

Algebraic Geometry · Mathematics 2017-12-04 Ties Laarakker

Pseudocycles are geometric representatives for integral homology classes on smooth manifolds that have proved useful in particular for defining gauge-theoretic invariants. The Borel-Moore homology is often a more natural object to work with…

Algebraic Topology · Mathematics 2022-09-22 Spencer Cattalani , Aleksey Zinger

We introduce a novel variant of BSS machines called Separate Branching BSS machines (S-BSS in short) and develop a Fagin-type logical characterisation for languages decidable in non-deterministic polynomial time by S-BSS machines. We show…

Logic in Computer Science · Computer Science 2020-07-09 Miika Hannula , Juha Kontinen , Jan Van den Bussche , Jonni Virtema

We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic L, which is defined from L in a similar way as the…

Logic in Computer Science · Computer Science 2015-07-01 Kord Eickmeyer , Martin Grohe

The notion of multivariate $P$- and $Q$-polynomial association scheme has been introduced recently, generalizing the well-known univariate case. Numerous examples of such association schemes have already been exhibited. In particular, it…

Combinatorics · Mathematics 2023-06-12 Nicolas Crampe , Luc Vinet , Meri Zaimi , Xiaohong Zhang

We look at classes of languages associated to the fragment of first-order logic B{\Sigma}1 which disallows quantifier alternations. Each class is defined by choosing the set of predicates on positions that may be used. Two key such…

Formal Languages and Automata Theory · Computer Science 2022-10-04 Thomas Place , Marc Zeitoun

In a previous paper it was shown that a machine learning regression problem can be solved within the framework of random function theory, with the optimal kernel analytically derived from symmetry and indifference principles and coinciding…

Machine Learning · Computer Science 2025-12-19 Yuriy N. Bakhvalov

We use quantum invariants to define an analytic family of representations for the mapping class group of a punctured surface. The representations depend on a complex number A with |A| <= 1 and act on an infinite-dimensional Hilbert space.…

Geometric Topology · Mathematics 2014-11-11 Francesco Costantino , Bruno Martelli

Incorporating probabilistic terms in mathematical models is crucial for capturing and quantifying uncertainties in real-world systems, especially when the solution is not unique or exhibits sudden qualitative changes as parameters vary.…

Numerical Analysis · Mathematics 2026-02-17 Isabella Carla Gonnella , Moaad Khamlich , Federico Pichi , Gianluigi Rozza

The $P$ versus $NP$ problem is still unsolved. But there are several oracles with $P$ unequal $NP$ relative to them. Here we will prove, that $P\not=NP$ relative to a $P$-complete oracle. In this paper, we use padding arguments as the proof…

Computational Complexity · Computer Science 2023-05-04 Reiner Czerwinski

In \cite{Lusztig}, Lusztig gives an explicit formula for the bijection between the set of bipartitions and the set $\mathcal{N}$ of unipotent classes in a spin group which carry irreducible local systems equivariant for the spin group but…

Representation Theory · Mathematics 2018-10-24 Jianqiao Xia

This paper deals with the partition function of the Ising model from statistical mechanics, which is used to study phase transitions in physical systems. A special case of interest is that of the Ising model with constant energies and…

Computational Complexity · Computer Science 2012-10-15 Tomer Kotek

We propose a framework to study models of computation of indeterministic data, represented by abstract "distributions". In these distributions, probabilities are replaced by "amplitudes" drawn from a fixed semi-ring $S$, of which the…

Computational Complexity · Computer Science 2014-12-24 Niel de Beaudrap

We prove two sets of results concerning computational complexity classes. The first concerns a variation of the random oracle hypothesis posed by Bennett and Gill after they showed that relative to a randomly chosen oracle, P not equal NP…

Logic · Mathematics 2022-10-25 Alex Creiner , Stephen Jackson

In this note, we examine how the BKP structure of the generating series of several models of maps on non-oriented surfaces can be used to obtain explicit and/or efficient recurrence formulas for their enumeration according to the genus and…

Combinatorics · Mathematics 2023-06-23 Valentin Bonzom , Guillaume Chapuy , Maciej Dołęga

A genus one curve of degree 5 is defined by the 4 x 4 Pfaffians of a 5 x 5 alternating matrix of linear forms on P^4. We describe a general method for investigating the invariant theory of such models. We use it to explain how we found our…

Number Theory · Mathematics 2011-10-18 Tom Fisher

We consider the problem of the determination of the isotropy classes of the orbit spaces of all the real linear groups, with three independent basic invariants satisfying only one independent relation. The results are obtained in the $\hat…

Condensed Matter · Physics 2007-05-23 Gianpaolo Valente

We give $\operatorname{CMSO}$-transductions that, given a graph $G$, output its modular decomposition, its split decomposition and its bi-join decomposition. This improves results by Courcelle [Logical Methods in Computer Science, 2006] who…

Logic in Computer Science · Computer Science 2026-05-12 Rutger Campbell , Bruno Guillon , Mamadou Moustapha Kanté , Eun Jung Kim , Noleen Köhler