English
Related papers

Related papers: Some properties of B\"uchi Arithmetics

200 papers

The concept of b-linear functional and its different types of continuity in linear n-normed space are presented and some of their properties are being established. We derive the Uniform Boundedness Principle and Hahn-Banach extension…

Functional Analysis · Mathematics 2021-10-26 Prasenjit Ghosh , T. K. Samanta

We study the problem of computing the rank of a divisor on a finite graph, a quantity that arises in the Riemann-Roch theory on a finite graph developed by Baker and Norine (Advances of Mathematics, 215(2): 766-788, 2007). Our work consists…

Combinatorics · Mathematics 2011-12-01 Madhusudan Manjunath

The rank of a skew partition $\lambda/\mu$, denoted $rank(\lambda/\mu)$, is the smallest number $r$ such that $\lambda/\mu$ is a disjoint union of $r$ border strips. Let $s_{\lambda/\mu}(1^t)$ denote the skew Schur function…

Combinatorics · Mathematics 2007-05-23 Guo-Guang Yan , Arthur L. B. Yang , Joan J. Zhou

Let A be a set of integers. For every integer n, let r_{A,h}(n) denote the number of representations of n in the form n = a_1 + a_2 + ... + a_h, where a_1, a_2,...,a_h are in A and a_1 \leq a_2 \leq ... \leq a_h. The function r_{A,h}: Z \to…

Number Theory · Mathematics 2016-12-30 Melvyn B. Nathanson

We prove new barrier results in arithmetic complexity theory, showing severe limitations of natural lifting (aka escalation) techniques. For example, we prove that even optimal rank lower bounds on $k$-tensors cannot yield non-trivial lower…

Computational Complexity · Computer Science 2019-04-10 Ankit Garg , Visu Makam , Rafael Oliveira , Avi Wigderson

Given a right-infinite word $\bf x$ over a finite alphabet $A$, the rank of $\bf x$ is the size of the smallest set $S$ of words over $A$ such that $\bf x$ can be realized as an infinite concatenation of words in $S$. We show that the…

Formal Languages and Automata Theory · Computer Science 2021-08-13 Jason Bell , Jeffrey Shallit

We show that if A is a linear order then Th(A) is either $\aleph_0$-categorical or Borel complete (in the sense of Friedman and Stanley). We generalize this; if A has countably many unary predicates attached, then Th(A) is…

Logic · Mathematics 2016-04-01 Richard Rast

The class of quasiseparable matrices is defined by a pair of bounds, called the quasiseparable orders, on the ranks of the maximal sub-matrices entirely located in their strictly lower and upper triangular parts. These arise naturally in…

Symbolic Computation · Computer Science 2016-09-20 Clement Pernet

Let \phi be a first order formula and M be a countable model. \phi^M denotes the set of all assignments that satisfy \phi in M. Let M, N be countable models. A formula \phi distinguishes these models if |\phi^M|\neq |\phi^N|. We show that…

Logic · Mathematics 2013-04-04 Mohammed Assem , Tarek Sayed Ahmed

We study extensions of Sem\"enov arithmetic, the first-order theory of the structure $(\mathbb{N}, +, 2^x)$. It is well-knonw that this theory becomes undecidable when extended with regular predicates over tuples of number strings, such as…

Logic in Computer Science · Computer Science 2023-06-27 Andrei Draghici , Christoph Haase , Florin Manea

We present a denotational semantics for higher-order probabilistic programs in terms of linear operators between Banach spaces. Our semantics is rooted in the classical theory of Banach spaces and their tensor products, but bears…

Logic in Computer Science · Computer Science 2019-03-01 Fredrik Dahlqvist , Dexter Kozen

The Weihrauch degrees and strong Weihrauch degrees are partially ordered structures representing degrees of unsolvability of various mathematical problems. Their study has been widely applied in computable analysis, complexity theory, and…

Logic · Mathematics 2017-04-06 Damir Dzhafarov

Let A be a set of integers and let h \geq 2. For every integer n, let r_{A, h}(n) denote the number of representations of n in the form n=a_1+...+a_h, where a_1,...,a_h belong to the set A, and a_1\leq ... \leq a_h. The function r_{A,h}…

Number Theory · Mathematics 2021-01-06 Javier Cilleruelo , Melvyn B. Nathanson

It is shown by constructing Rohlins canonical measures that for a strictly stationary, d-dimensional vector-valued process X there exists another strictly stationary d-dimensional process U with uniform one-dimensional marginals and with…

Probability · Mathematics 2024-07-10 Manfred Denker

We describe the set of maximal orders in a 2-by-2 matrix algebra over a non-commutative local division algebra B containing a given suborder, for certain important families of such suborders, including rings of integers of division…

Number Theory · Mathematics 2017-12-12 Manuel Arenas , Luis Arenas-Carmona

The aim of this note is to provide an upper bound of the number of positive integers $\le x$ which can be written as $\varphi(n)$ for some positive integer $n$, where $\varphi$ stands for the Euler's function. The order of magnitude of this…

Number Theory · Mathematics 2015-10-07 Paolo Leonetti

In 2020, Roger Baker \cite{Bak} proved a result on the exceptional set of moduli in the prime number theorem for arithmetic progressions of the following kind. Let $\mathcal{S}$ be a set of pairwise coprime moduli $q\le x^{9/40}$. Then the…

Number Theory · Mathematics 2022-06-24 Stephan Baier , Sudhir Pujahari

Consider the following curious puzzle: call an n-tuple X=(X_1, ..., X_n) of sets smaller than another n-tuple Y if it has fewer //unordered sections//. We show that equivalence classes for this preorder are very easy to describe and…

Combinatorics · Mathematics 2014-04-02 Pierre Hyvernat

In continuation of the paper [3], we discuss various consequences of Hahn-Banach theorem for bounded b-linear functional in linear n-normed space and describe the notion of reflexivity of linear n-normed space with respect to bounded…

Functional Analysis · Mathematics 2024-10-29 Prasenjit Ghosh , Tapas Kumar Samanta

In section 1 we consider a 3-tuple $S=(|S|,\preccurlyeq,E)$ where $|S|$ is a finite set, $\preccurlyeq$ a partial ordering on $|S|,$ and $E$ a set of unordered pairs of distinct members of $|S|,$ and study, as a function of $n\geq 0,$ the…

Combinatorics · Mathematics 2018-06-12 George M. Bergman
‹ Prev 1 3 4 5 6 7 10 Next ›