English
Related papers

Related papers: Finite models for positive combinatorial and expon…

200 papers

We introduce fusion algebras with not necessarily positive structure constants and without identity element. We prove that they are semisimple when tensored with $\mathbb{C}$ and that their characters satisfy orthogonality relations. Then…

Rings and Algebras · Mathematics 2007-05-23 Michael Cuntz

A commutative semigroup of abstract factorials is defined in the context of the ring of integers. We study such factorials for their own sake, whether they are or are not connected to sets of integers. Given a subset X of the positive…

Number Theory · Mathematics 2012-07-11 Angelo B. Mingarelli

Nonunique factorization in cancellative commutative semigroups is often studied using combinatorial factorization invariants, which assign to each semigroup element a quantity determined by the factorization structure. For numerical…

Commutative Algebra · Mathematics 2018-08-15 Christopher O'Neill

Computational effects are commonly modelled by monads, but often a monad can be presented by an algebraic theory of operations and equations. This talk is about monads and algebraic theories for languages for inference, and their…

Logic in Computer Science · Computer Science 2023-12-29 Cristina Matache , Sean Moss , Sam Staton , Ariadne Si Suo

For a finite-dimensional algebra {\Lambda}, we establish an explicit bijection between widely generated torsion(-free) classes and semibricks in mod {\Lambda}. Using the kappa order on the lattice of torsion classes with canonical join…

Representation Theory · Mathematics 2026-02-17 Alireza Nasr-Isfahani

We give a survey on the theory of representation-finite and certain minimal representation-infinite algebras.The main goals are the existence of multiplicative bases and of coverings with good properties. Both are attained via…

Representation Theory · Mathematics 2013-02-06 Klaus Bongartz

Programs with a continuous state space or that interact with physical processes often require notions of equivalence going beyond the standard binary setting in which equivalence either holds or does not hold. In this paper we explore the…

Logic in Computer Science · Computer Science 2024-02-14 Fredrik Dahlqvist , Renato Neves

Let $\mathcal{R}$ be a finite valuation ring of order $q^r$. In this paper we generalize and improve several well-known results, which were studied over finite fields $\mathbb{F}_q$ and finite cyclic rings $\mathbb{Z}/p^r\mathbb{Z}$, in the…

Combinatorics · Mathematics 2016-11-22 Pham Van Thang , Le Anh Vinh

A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane…

Combinatorics · Mathematics 2013-10-07 Matthias Beck

We study maximal subalgebras of an arbitrary finite dimensional algebra over a field, and obtain full classification/description results of such algebras. This is done by first obtaining a complete classification in the semisimple case, and…

Rings and Algebras · Mathematics 2017-08-31 Miodrag Iovanov , Alexander Sistko

We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…

Optimization and Control · Mathematics 2014-01-13 Bogdan Dumitrescu , Bogdan C. Sicleru , Florin Avram

We explore the possibility of extending Mardare et al. quantitative algebras to the structures which naturally emerge from Combinatory Logic and the lambda-calculus. First of all, we show that the framework is indeed applicable to those…

Logic in Computer Science · Computer Science 2022-04-29 Ugo Dal Lago , Furio Honsell , Marina Lenisa , Paolo Pistone

The infinitary propositional logic of here-and-there is important for the theory of answer set programming in view of its relation to strongly equivalent transformations of logic programs. We know a formal system axiomatizing this logic…

Logic in Computer Science · Computer Science 2016-08-05 Amelia Harrison , Vladimir Lifschitz , Julian Michael

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Discrete Mathematics · Computer Science 2017-08-08 Emmanuel Jeandel

We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…

Logic · Mathematics 2009-05-19 Jaap van Oosten

Aiming to harmonise finite and infinite model reasoning, we initiate the study of partially finite models, where the reasoning task comes with a formula that specifies a part of the model that must be finite. We focus on the problem of…

Logic in Computer Science · Computer Science 2026-04-29 Tomasz Gogacz , Filip Murlak , Marcin Przybyłko , Alexandra Rogova , Michał Skrzypczak

We investigate the categories of finite-dimensional representations of multicurrent and multiloop hyperalgebras in positive characteristic, i.e., the hyperalgebras associated to the multicurrent algebras $\mathfrak…

Representation Theory · Mathematics 2020-02-07 Angelo Bianchi , Samuel Chamberlin

Given an action of an affine algebraic group with only trivial characters on a factorial variety, we ask for categorical quotients. We characterize existence in the category of algebraic varieties. Moreover, allowing constructible sets as…

Algebraic Geometry · Mathematics 2013-05-15 I. V. Arzhantsev , D. Celik , J. Hausen

We prove completeness, interpolation and omitting types for certain predicate topological logics that properly extend the first order case. We aslo count the non isomorphic topological models of a countable theory

Logic · Mathematics 2013-04-08 Tarek Sayed Ahmed

In this paper we extensively investigate the class of conditionally positive definite operators, namely operators generating conditionally positive definite sequences. This class itself contains subnormal operators, $2$- and $3$-isometries…

Functional Analysis · Mathematics 2022-01-26 Zenon Jan Jabłoński , Il Bong Jung , Jan Stochel