English
Related papers

Related papers: Some properties of B\"uchi Arithmetics

200 papers

We show that the existential fragment of B\"uchi arithmetic is strictly less expressive than full B\"uchi arithmetic of any base, and moreover establish that its $\Sigma_2$-fragment is already expressively complete. Furthermore, we show…

Logic in Computer Science · Computer Science 2021-03-04 Christoph Haase , Jakub Różycki

Let $n$ be a positive integer and $G(n)$ denote the number of non-isomorphic finite groups of order $n$. It is well-known that $G(n) = 1$ if and only if $(n,\phi(n)) = 1$, where $\phi(n)$ and $(a, b)$ denote the Euler's totient function and…

Group Theory · Mathematics 2017-05-22 A. R. Ashrafi , E. Haghi

The nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one factors needed to reconstruct it exactly. The problem of determining this rank and computing the corresponding nonnegative factors is difficult;…

Optimization and Control · Mathematics 2012-08-30 Nicolas Gillis , François Glineur

Let $B_n$ (resp. $U_n$, $N_n$) be the set of $n\times n$ nonsingular (resp. unit, nilpotent) upper triangular matrices. We use a novel approach to explore the $B_n$-similarity orbits in $N_n$. The Belitski\u{\i}'s canonical form of $A\in…

Representation Theory · Mathematics 2020-02-25 Ming-Cheng Tsai , Meaza Bogale , Huajun Huang

Let $(\mathbf{B}, \|\cdot\|)$ be a real separable Banach space. Let $\{X, X_{n}; n \geq 1\}$ be a sequence of i.i.d. {\bf B}-valued random variables and set $S_{n} = \sum_{i=1}^{n}X_{i},~n \geq 1$. Let $\{a_{n}; n \geq 1\}$ and $\{b_{n}; n…

Probability · Mathematics 2015-06-26 Deli Li , Han-Ying Liang

Let $A$ be a Banach algebra with a bounded left approximate identity $\{e_\lambda\}_{\lambda\in\Lambda}$, let $\pi$ be a continuous representation of $A$ on a Banach space $X$, and let $S$ be a non-empty subset of $X$ such that…

Functional Analysis · Mathematics 2017-05-30 Marcel de Jeu , Xingni Jiang

In the 1970s M. Laczkovich posed the following problem: Let $\mathcal{B}_1(X)$ denote the set of Baire class $1$ functions defined on an uncountable Polish space $X$ equipped with the pointwise ordering. \[\text{Characterize the order types…

Logic · Mathematics 2016-11-29 Márton Elekes , Zoltán Vidnyánszky

We relate Nekrasov partition functions, with arbitrary values of $\epsilon_1,\epsilon_2$ parameters, to matrix models for $\beta$-ensembles. We find matrix models encoding the instanton part of Nekrasov partition functions, whose measure,…

High Energy Physics - Theory · Physics 2010-04-30 Piotr Sułkowski

For a finite set $A$ of size $n$, an ordering is an injection from $\{1,2,\ldots,n\}$ to $A$. We present results concerning the asymptotic properties of the length $L_n$ of the longest arithmetic subsequence in a random ordering of an…

Combinatorics · Mathematics 2021-09-30 Marcel K. Goh , Rosie Y. Zhao

As a follow-up to work done in [7], some new insights to the structure of the socle of a semisimple Banach algebra is obtained. In particular, it is shown that the socle is isomorphic as an algebra to the direct sum of tensor products of…

Functional Analysis · Mathematics 2018-08-21 Rudi Brits , Francois Schulz

A boolean term order is a total order on subsets of [n]={1,...,n} such that \emptyset < alpha for all nonempty alpha contained in [n], and alpha < beta implies alpha \cup gamma < beta \cup gamma for all gamma which do not intersect alpha or…

Combinatorics · Mathematics 2007-05-23 Diane Maclagan

We introduce axiomatically the ring $\bf{Z}_\kappa$ of the Euclidean integers, that can be viewed as the ``integral part" of the field $\mathbb{E}$ of Euclidean numbers of [4], where the transfinite sum of ordinal indexed $\kappa$-sequences…

Logic · Mathematics 2022-12-06 Mauro Di Nasso , Marco Forti

We propose $\omega$MSO$\Join$BAPA, an expressive logic for describing countable structures, which subsumes and transcends both Counting Monadic Second-Order Logic (CMSO) and Boolean Algebra with Presburger Arithmetic (BAPA). We show that…

Logic in Computer Science · Computer Science 2023-11-27 Luisa Herrmann , Vincent Peth , Sebastian Rudolph

We study the asymptotic behaviour of Bessel functions associated of root systems of type $A_{n-1}$ and type $B_n$ with positive multiplicities as the rank $n$ tends to infinity. In both cases, we characterize the possible limit functions…

Classical Analysis and ODEs · Mathematics 2024-05-01 Dominik Brennecken , Margit Rösler

We show that the order dimension of the weak order on a Coxeter group of type A, B or D is equal to the rank of the Coxeter group, and give bounds on the order dimensions for the other finite types. This result arises from a unified…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

The $\pi$-calculus is the paradigmatical name-passing calculus. While being purely name-passing, it allows the representation of higher-order functions and store. We study how $\pi$-calculus processes can be controlled so that computations…

Logic in Computer Science · Computer Science 2025-04-25 Daniel Hirschkoff , Iwan Quémerais , Davide Sangiorgi

We describe the structure of the symbolic powers $I^{(\ell)}$ of the Stanley-Reisner ideals, and cover ideals, $I$, of matroids. We (a) prove a structure theorem describing a minimal generating set for every $I^{(\ell)}$; (b) describe the…

Commutative Algebra · Mathematics 2024-06-21 Paolo Mantero , Vinh Nguyen

Let $k,\ell\geq 2$ be two multiplicatively independent integers. Cobham's famous theorem states that a set $X\subseteq \mathbb{N}$ is both $k$-recognizable and $\ell$-recognizable if and only if it is definable in Presburger arithmetic.…

Logic · Mathematics 2023-09-04 Philipp Hieronymi , Chris Schulz

The representation dimension of an artin algebra as introduced by M.Auslander in his Queen Mary Notes is the minimal possible global dimension of the endomorphism ring of a generator-cogenerator. The paper is based on two texts written in…

Representation Theory · Mathematics 2011-07-12 Claus Michael Ringel

Let $NFA_b(q)$ denote the set of languages accepted by nondeterministic finite automata with $q$ states over an alphabet with $b$ letters. Let $B_n$ denote the set of words of length $n$. We give a quadratic lower bound on the VC dimension…

Formal Languages and Automata Theory · Computer Science 2021-08-06 Bjørn Kjos-Hanssen , Clyde James Felix , Sun Young Kim , Ethan Lamb , Davin Takahashi