English
Related papers

Related papers: A non-sequential arithmetical theory with pairing

200 papers

An $\omega$-tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism problem for $\omega$-tree-automatic structures. We prove…

Logic · Mathematics 2010-07-26 Olivier Finkel , Stevo Todorcevic

An aggregative composition is a binary operation obeying the principle that the whole is determined by the sum of its parts. The development of graph algebras, on which the theory of formal graph languages is built, relies on aggregative…

Formal Languages and Automata Theory · Computer Science 2025-10-13 Marius Bozga , Radu Iosif , Florian Zuleger

Suppose that $(x_s)_{s\in S}$ is a normalized family in a Banach space indexed by the dyadic tree $S$. Using Stern's combinatorial theorem we extend important results from sequences in Banach spaces to tree-families. More precisely,…

Functional Analysis · Mathematics 2013-05-21 Costas Poulios , Athanasios Tsarpalias

We present a class of solvable models that resemble string theories in many respects but have a strikingly different non-perturbative sector. In particular, there are no exponentially small contributions to perturbation theory in the string…

High Energy Physics - Theory · Physics 2007-05-23 Clifford V. Johnson

We define a pairing map $\pi_{\mathsf{CL}} : \mathbb{N}^2\to\mathbb{N}$ that encodes $x$ and $y$ into two disjoint bands of Zeckendorf indices separated by a delimiter computed from $x$. The construction is "carryless" by design: the…

Logic · Mathematics 2026-05-12 Milan Rosko

In this paper we prove that the Scott topology $\mathfrak S$ on a rooted non-metric tree $\mathcal T$ is strictly coarser than the weak tree topology. Moreover, for each $t\in \mathcal T$, we consider a natural order $\preceq_t$ on…

Commutative Algebra · Mathematics 2015-09-22 Josnei Novacoski

In [Dugan-Glennon-Gunnells-Steingrimsson-2019], the authors introduce tiered trees to define combinatorial objects counting absolutely indecomposable representations of certain quivers, and torus orbits on certain homogeneous varieties. In…

Combinatorics · Mathematics 2023-03-02 Michele D'Adderio , Alessandro Iraci , Yvan LeBorgne , Marino Romero , Anna Vanden Wyngaerd

This paper gives an overview of $\left(p,q\right)$-adic Fourier theory - the Fourier theory of functions from the $p$-adic numbers to the $q$-adic numbers, where $p$ and $q$ are distinct primes - which we then use to prove a novel…

General Mathematics · Mathematics 2025-06-24 Maxwell C. Siegel

Recently, a relation between Schreier-type sets and Tur\'{a}n graphs was discovered. In this note, we give a combinatorial proof and obtain a generalization of the relation. Specifically, for $p, q\ge 1$, let $$\mathcal{A}_q :=…

Combinatorics · Mathematics 2022-05-18 Hung Viet Chu

The paper is devoted to a reverse-mathematical study of some well-known consequences of Ramsey's theorem for pairs, focused on the chain-antichain principle $\mathsf{CAC}$, the ascending-descending sequence principle $\mathsf{ADS}$, and the…

For both f(R) theories of gravity with an independent symmetric connection (no torsion), usually referred to as Palatini f(R) gravity theories, and for f(R) theories of gravity with torsion but no non-metricity, called U4 theories, it has…

General Relativity and Quantum Cosmology · Physics 2010-04-30 Thomas P. Sotiriou

We initiate the study of Simultaneous Graph Embedding with Fixed Edges in the beyond planarity framework. In the QuaSEFE problem, we allow edge crossings, as long as each graph individually is drawn quasiplanar, that is, no three edges…

Data Structures and Algorithms · Computer Science 2019-08-26 Patrizio Angelini , Henry Förster , Michael Hoffmann , Michael Kaufmann , Stephen Kobourov , Giuseppe Liotta , Maurizio Patrignani

Our "long term and large scale" aim is to characterize the first order theories T (at least the countable ones) such that: for every ordinal alpha there lambda,M_1,M_2 such that M_1,M_2 are non-isomorphic models of T of cardinality lambda…

Logic · Mathematics 2017-08-08 Saharon Shelah

The Matrix-Tree Theorem states that the number of spanning trees of a graph is given by the absolute value of any cofactor of the Laplacian matrix of the graph. We propose a very short proof of this result which amounts to comparing Taylor…

Combinatorics · Mathematics 2023-03-14 Amitai Netser Zernik

Recently, Ehrenborg and Van Willenburg defined a class of bipartite graphs that correspond naturally to Ferrers diagrams, and proved several results about them. We give bijective proofs for the (already known) expressions for the number of…

Combinatorics · Mathematics 2007-05-23 Jason Burns

The Gy\'arf\'as tree packing conjecture asserts that any set of trees with $2,3, ..., k$ vertices has an (edge-disjoint) packing into the complete graph on $k$ vertices. Gy\'arf\'as and Lehel proved that the conjecture holds in some special…

Combinatorics · Mathematics 2011-10-24 Dániel Gerbner , Balázs Keszegh , Cory Palmer

Kirchhoff's matrix-tree theorem states that the number of spanning trees of a graph G is equal to the value of the determinant of the reduced Laplacian of $G$. We outline an efficient bijective proof of this theorem, by studying a canonical…

Combinatorics · Mathematics 2012-07-26 Farbod Shokrieh

We describe quasi-Hopf twist deformations of flat closed string compactifications with non-geometric R-flux using a suitable cochain twist, and construct nonassociative deformations of fields and differential calculus. We report on our new…

High Energy Physics - Theory · Physics 2016-01-20 Dionysios Mylonas , Richard J. Szabo

We develop a quantization scheme for the quantum theory of a real scalar field on a class of non-commutative spacetime models collectively known as T-Minkowski. Requiring the theory to be covariant under T-Poincar\'e transformations, we…

High Energy Physics - Theory · Physics 2025-08-07 Giuseppe Fabiano , Flavio Mercati

This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by…

Combinatorics · Mathematics 2013-05-17 Jean-Christophe Aval , Adrien Boussicault , Mathilde Bouvel , Matteo Silimbani
‹ Prev 1 4 5 6 7 8 10 Next ›