English
Related papers

Related papers: On the Possibilities of Defining Infinite Oriented…

200 papers

A unital $C^*$-algebra is called $N$-subhomogeneous if its irreducible representations are finite dimensional with dimension at most $N$. We extend this notion to operator systems, replacing irreducible representations by boundary…

Operator Algebras · Mathematics 2023-02-10 Ran Kiri

As a motivation, we first recall the possible connection of electric-magnetic duality to finiteness in N=1 super-Yang-Mills theories (SYM). Then, we present the criterion for all-order finiteness (i.e., vanishing of the beta-functions at…

High Energy Physics - Phenomenology · Physics 2011-04-15 C. Lucchesi , G. Zoupanos

We reconstruct finite-dimensional quantum theory with superselection rules, which can describe hybrid quantum-classical systems, from four purely operational postulates: symmetric sharpness, complete mixing, filtering, and local equality.…

Quantum Physics · Physics 2026-05-26 Kenji Nakahira

Homomorphism duality pairs play crucial role in the theory of relational structures and in the Constraint Satisfaction Problem. The case where both classes are finite is fully characterized. The case when both side are infinite seems to be…

Combinatorics · Mathematics 2015-06-04 Péter L. Erdős , Dömötör Pálvölgyi , Claude Tardif , Gábor Tardos

There is a long list of open questions rooted in the same underlying problem: understanding the structure of bases or common bases of matroids. These conjectures suggest that matroids may possess much stronger structural properties than are…

Combinatorics · Mathematics 2024-11-05 Kristóf Bérczi , Áron Jánosik , Bence Mátravölgyi

We consider a finite-dimensional vector space $W\subset K^E$ over an arbitrary field $K$ and an arbitrary set $E$. We show that the set $C(W)\subset 2^E$ consisting of the minimal supports of $W$ are the circuits of a matroid on $E$. In…

Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…

Discrete Mathematics · Computer Science 2017-07-28 Jean Néraud , Carla Selmi

We give a new criterion which guarantees that a free group admits a bi-ordering that is invariant under a given automorphism. As an application, we show that the fundamental group of the "magic manifold" is bi-orderable, answering a…

Group Theory · Mathematics 2026-01-14 Tommy Wuxing Cai , Adam Clay , Dale Rolfsen

In this paper we consider the modal logic with both Box and Diamond arising fromKripke models with a crisp accessibility and whose propositions are valued over the stan-dard Godel algebra [0,1]G. We provide an axiomatic system extending the…

Logic · Mathematics 2020-05-01 Ricardo Oscar Rodriguez , Amanda Vidal Wandelmer

We conceive finite automata as dynamical systems on discontinuum and investigate their factors. Factors of finite automata include many well-known simple dynamical systems, e.g. hyperbolic systems and systems with finite attractors. In the…

chao-dyn · Physics 2008-02-03 Petr Kurka

Using linear functional-based duality of modules, we generalize the syndrome decoding algorithm of linear codes over finite fields to those over finite commutative rings. Moreover, If the ring is local the algorithm is simplified by…

Information Theory · Computer Science 2014-10-14 Asmae Drhima , Mustapha Najmeddine

Axiomatizing mathematical structures and theories is an objective of Mathematical Logic. Some axiomatic systems are nowadays mere definitions, such as the axioms of Group Theory; but some systems are much deeper, such as the axioms of…

Logic · Mathematics 2023-05-18 Saeed Salehi

We considered the possibility that the oriented matroid theory is connected with supersymmetry via the Grassmann-Plucker relations. The main reason for this, is that such relations arise in both in the chirotopes definition of an oriented…

High Energy Physics - Theory · Physics 2007-05-23 J. A. Nieto

This paper is a direct generalization of Baker-Bowler theory to flag matroids, including its moduli interpretation as developed by Baker and the second author for matroids. More explicitly, we extend the notion of flag matroids to flag…

Combinatorics · Mathematics 2024-01-17 Manoel Jarra , Oliver Lorscheid

The problem of classifying tuples of nilpotent matrices over a field under simultaneous conjugation is considered "hopeless". However, for any given matrix order over a finite field, the number of concerned orbits is always finite. This…

Representation Theory · Mathematics 2021-05-06 Jiuzhao Hua

We present the model theoretic concepts that allow mathematics to be developed with the notion of the potential infinite instead of the actual infinite. The potential infinite is understood as a dynamic notion, being an indefinitely…

Logic · Mathematics 2022-12-16 Matthias Eberl

Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…

Logic in Computer Science · Computer Science 2021-01-26 Michał R. Przybyłek

We formulate physically-motivated axioms for a physical theory which for systems with a finite number of degrees of freedom uniquely lead to Quantum Mechanics as the only nontrivial consistent theory. Complex numbers and the existence of…

Quantum Physics · Physics 2013-06-04 Anton Kapustin

We introduce dual matroids of 2-dimensional simplicial complexes. Under certain necessary conditions, duals matroids are used to characterise embeddability in 3-space in a way analogous to Whitney's planarity criterion. We further use dual…

Combinatorics · Mathematics 2017-09-15 Johannes Carmesin

Contraction$^*$-depth is considered to be one of the analogues of graph tree-depth in the matroid setting. In this paper, we investigate structural properties of contraction$^*$-depth of matroids representable over finite fields and…

Combinatorics · Mathematics 2025-01-17 Jakub Gajarský , Kristýna Pekárková , Michał Pilipczuk
‹ Prev 1 8 9 10 Next ›