English
Related papers

Related papers: The Complexity of the Core Model

200 papers

We characterize exactly the compactness properties of the product of \kappa\ copies of the space \omega\ with the discrete topology. The characterization involves uniform ultrafilters, infinitary languages, and the existence of nonstandard…

General Topology · Mathematics 2016-08-30 Paolo Lipparini

In this thesis, we study the place of regular languages within the communication complexity setting. In particular, we are interested in the non-deterministic communication complexity of regular languages. We show that a regular language…

Computational Complexity · Computer Science 2008-02-01 Anil Ada

We show that the decision problem for the basic system of interpretability logic IL is PSPACE-complete. For this purpose we present an algorithm which uses polynomial space with respect to the complexity of a given formula. The existence of…

Logic · Mathematics 2018-04-09 Luka Mikec , Fedor Pakhomov , Mladen Vuković

For finite abstract simplicial complex $\Sigma$, initial realization $\alpha$ in $\mathbb{E}^d$, and desired edge lengths $L$, we give practical sufficient conditions for the existence of a non-self-intersecting perturbation of $\alpha$…

Geometric Topology · Mathematics 2023-12-12 Matthew Ellison

We exhibit an $n$-node graph whose independent set polytope requires extended formulations of size exponential in $\Omega(n/\log n)$. Previously, no explicit examples of $n$-dimensional $0/1$-polytopes were known with extension complexity…

Computational Complexity · Computer Science 2016-04-26 Mika Göös , Rahul Jain , Thomas Watson

We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpler one. We give some applications of this method to complexes arising from graphs. As a consequence, we answer some questions raised in…

Combinatorics · Mathematics 2007-05-23 Mario Marietti , Damiano Testa

Assuming that there is no inner model with a strong cardinal, the following is shown: any subset of \omega_1 can be made \Delta^1_3 (in the codes) by a reasonable set-forcing; there is a reasonable set-generic extension with a \Delta^1_3…

Logic · Mathematics 2009-09-25 Ralf Schindler

We give a complete characterisation of the linear isometries of ${\rm Hol}(\Omega)$, where $\Omega$ is the half-plane, the complex plane or an annulus centered at 0 and symmetric to the unit circle. Moreover, we introduce new techniques to…

Functional Analysis · Mathematics 2025-01-20 Isabelle Chalendar , Lucas Oger , Jonathan R. Partington

We present a probabilistic algorithm to test if a homogeneous polynomial ideal $I$ defining a scheme $X$ in $\mathbb{P}^n$ is radical using Segre classes and other geometric notions from intersection theory. Its worst case complexity…

Algebraic Geometry · Mathematics 2021-10-06 Martin Helmer , Elias Tsigaridas

We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite then the complexity of hyperfinite countable Borel equivalence relations is as high as possible, namely,…

Logic · Mathematics 2024-09-26 Joshua Frisch , Forte Shinko , Zoltan Vidnyanszky

Let $C$ be an affine curve over an algebraically closed field $k$ of characteristic $p>0$. Given an embedding problem $(\beta:\Gamma\longrightarrow G, \alpha: \pi^{et}_1(C)\longrightarrow G)$ for $\pi_1^{et}(C)$ where $\beta$ is a…

Algebraic Geometry · Mathematics 2024-03-07 Manish Kumar , Poulami Mandal

The complexity of a module is the rate of growth of the minimal projective resolution of the module while the $z$-complexity is the rate of growth of the number of indecomposable summands at each step in the resolution. Let…

Representation Theory · Mathematics 2017-03-21 Houssein El Turkey

A method of {\it topological grammars} is proposed for multidimensional data approximation. For data with complex topology we define a {\it principal cubic complex} of low dimension and given complexity that gives the best approximation for…

Neural and Evolutionary Computing · Computer Science 2007-05-23 A. N. Gorban , N. R. Sumner , A. Y. Zinovyev

The class of the hypercomplex pseudo-Hermitian manifolds is considered. The flatness of the considered manifolds with the 3 parallel complex structures is proved. Conformal transformations of the metrics are introduced. The conformal…

Differential Geometry · Mathematics 2012-03-27 Kostadin Gribachev , Mancho Manev , Stancho Dimiev

We prove under $V=L$ that the inclusion modulo the non-stationary ideal is a $\Sigma_1^1$-complete quasi-order in the generalized Borel-reducibility hierarchy ($\kappa>\omega$). This improvement to known results in $L$ has many new…

Logic · Mathematics 2019-12-10 Tapani Hyttinen , Vadim Kulikov , Miguel Moreno

How to measure the complexity of a finite set of vectors embedded in a multidimensional space? This is a non-trivial question which can be approached in many different ways. Here we suggest a set of data complexity measures using universal…

Machine Learning · Computer Science 2013-01-03 Andrei Zinovyev , Evgeny Mirkes

We consider several formalizations in the language of second-order arithmetic of "The formula $\phi$ is a theorem of $\omega$-logic", including some which have been studied in the literature and a new variant defined via a least fixed…

Logic · Mathematics 2022-03-23 David Fernández-Duque

In physics, Lie groups represent the algebraic structure that describes symmetry transformations of a given system. Then, the descending Lie algebra of those groups are necessarily real. In most cases, the complexification of those Lie…

Mathematical Physics · Physics 2026-03-20 Tanguy Marsault , Laurent Schoeffel

Let $A$ be a star product on a symplectic manifold $(M,\omega_0)$, $\frac{1}{t}[\omega]$ its Fedosov class, where $\omega$ is a deformation of $\omega_0$. We prove that for a complex polarization of $\omega$ there exists a commutative…

Quantum Algebra · Mathematics 2007-05-23 P. Bressler , J. Donin

We calculate the possible Scott ranks of countable models of Peano arithmetic. We show that no non-standard model can have Scott rank less than $\omega$ and that non-standard models of true arithmetic must have Scott rank greater than…

Logic · Mathematics 2022-08-04 Antonio Montalbán , Dino Rossegger
‹ Prev 1 4 5 6 7 8 10 Next ›