English
Related papers

Related papers: Descriptive complexity of countable unions of Bore…

200 papers

We derive two types of representation results for increasing convex functionals in terms of countably additive measures. The first is a max-representation of functionals defined on spaces of real-valued continuous functions and the second a…

Functional Analysis · Mathematics 2021-03-30 Patrick Cheridito , Michael Kupper , Ludovic Tangpi

The Borel map takes germs at 0 of smooth functions to the sequence of iterated partial derivatives at 0. In the literature, it is well known that the restriction of this mapping to the germs of quasianalytic ultradifferentiable classes…

Functional Analysis · Mathematics 2018-09-03 Céline Esser , Gerhard Schindl

This paper is devoted to the study of analytic equivalence relations which are Borel graphable, i.e. which can be realized as the connectedness relation of a Borel graph. Our main focus is the question of which analytic equivalence…

Logic · Mathematics 2025-12-30 Tyler Arant , Alexander S. Kechris , Patrick Lutz

In this paper, we try to determine exact or bounds on the choosability, or list chromatic numbers of some Cayley graphs, typically some Unitary Cayley graphs and Cayley graphs on Dihedral groups.

Combinatorics · Mathematics 2024-02-27 Prajnanaswaroopa S

We show that there are uncountably many countable lattices. We give a discussion of which such lattices can be modular or distributive. The method applies to show that certain other classes of structures also have uncountably many…

Logic · Mathematics 2014-06-03 A. Abogatma , J. K. Truss

We study the Borel algebra de ne by [x a ; x b ] = 2 a;1 x b as a noncommutative manifold R 3 . We calculate its noncommutative di erential form relations. We deduce its partial derivative relations and the derivative of a plane wave. After…

Mathematical Physics · Physics 2013-04-10 Boris Arm

We prove a strong dichotomy result for countably-infinite oriented graphs; that is, we prove that for all countably-infinite oriented graphs $G$, either (i) there is a countably-infinite tournament $K$ such that $G\not\subseteq K$, or (ii)…

Combinatorics · Mathematics 2024-05-02 Alistair Benford , Louis DeBiasio , Paul Larson

The representation is essentially the same as that given by J.P.Nagle in J. Comb. Theory (B), 1971, 10:1, 42--59. The distinction is in the definition of the weighting function via the number of flows. This new definition allows one to…

Combinatorics · Mathematics 2009-03-09 Yu. V. Matiyasevich

This paper investigates the effective categoricity of ultrahomogeneous structures. It is shown that any computable ultrahomogeneous structure is $\Delta^0_2$ categorical. A structure A is said to be weakly ultrahomogeneous if there is a…

Logic · Mathematics 2016-08-04 Francis Adams , Douglas Cenzer

Bond percolation on Cayley graphs provides examples of random graphs. Other examples arise from the dynamical study of proper repetitive subgraphs of Cayley graphs. In this paper we demonstrate that these two families have mutually singular…

Dynamical Systems · Mathematics 2016-05-10 Fernando Alcalde Cuesta , Álvaro Lozano Rojo , Antón C. Vázquez Martínez

$(1^a, 2^b)$-coloring is the problem of partitioning the vertex set of a graph into $a$ independent sets and $b$ 2-independent sets. This problem was recently introduced by Choi and Liu. We study the computational complexity and extremal…

Combinatorics · Mathematics 2026-02-16 Thomas Delépine

Under Martin's Axiom we construct a Boolean countably compact topological group whose square is not countably pracompact.

General Topology · Mathematics 2020-03-09 Serhii Bardyla , Alex Ravsky , Lyubomyr Zdomskyy

We construct a measure on omega-one^2 over the ground model in the forcing extension of a measure algebra, and investigate when measure theoretic properties of some measurable colouring of omega-one^2 imply the existence of an uncountable…

Logic · Mathematics 2007-05-23 James Hirschorn

We investigate infinite versions of vector and affine space partition results, and thus obtain examples and a counterexample for a partition problem for relational structures. In particular we provide two (related) examples of an age…

Logic · Mathematics 2014-01-14 C. Laflamme , L. Nguyen Van The , M. Pouzet , N. Sauer

In this paper we consider the Borel combinatorics of Schreier graphs of $\mathbb{Z}$-actions with arbitrary finite generating sets. We formulate the Borel combinatorics in terms of existence of Borel equivariant maps from…

Combinatorics · Mathematics 2025-11-03 Su Gao , Yingying Jiang , Tianhao Wang

Using an explicit computable expression of ordinary multinomials, we establish three remarkable connections, with the q-generalized Fibonacci sequence, the exponential partial Bell partition polynomials and the density of convolution powers…

Combinatorics · Mathematics 2007-08-17 Hacene Belbachir , Sadek Bouroubi , Abdelkader Khelladi

For any pair of bounded observables $A$ and $B$ with pure point spectra, we construct an associated "joint observable" which gives rise to a notion of a joint (projective) measurement of $A$ and $B$, and which conforms to the intuition that…

Quantum Physics · Physics 2015-06-22 Richard DeJonghe , Kimberly Frey , Tom Imbo

Let $\lambda$ be an uncountable cardinal such that $2^{< \lambda } = \lambda$. Working in the setup of generalized descriptive set theory, we study the structure of $\lambda^+$-Borel measurable functions with respect to various kinds of…

Logic · Mathematics 2026-01-14 Luca Motto Ros , Beatrice Pitton

For a given conic bundle X over a curve C defined over F_q, we count irreducible branch covers of C in X of degree d and height e>>1. As a special case, we get the number of algebraic numbers of degree d and height e over the function field…

Number Theory · Mathematics 2008-09-08 Seyfi Turkelli

We prove lower and upper bounds for the chromatic number of certain hypergraphs defined by geometric regions. This problem has close relations to conflict-free colorings. One of the most interesting type of regions to consider for this…

Combinatorics · Mathematics 2011-05-03 Balázs Keszegh