English
Related papers

Related papers: Fracterm Calculus for Partial Meadows

200 papers

We give an expository review of applications of computational algebraic statistics to design and analysis of fractional factorial experiments based on our recent works. For the purpose of design, the techniques of Gr\"obner bases and…

Methodology · Statistics 2012-04-09 Satoshi Aoki , Akimichi Takemura

We compute a minimum degree threshold sufficient for 3-partite graphs to admit a fractional triangle decomposition. Together with recent work of Barber, K\"uhn, Lo, Osthus and Taylor, this leads to bounds for exact decompositions and in…

Combinatorics · Mathematics 2016-09-13 Flora C. Bowditch , Peter J. Dukes

Lawvere showed that generalised metric spaces are categories enriched over $[0, \infty]$, the quantale of the positive extended reals. The statement of enrichment is a quantitative analogue of being a preorder. Towards seeking a logic for…

Logic in Computer Science · Computer Science 2024-02-14 Giorgio Bacci , Radu Mardare , Prakash Panangaden , Gordon Plotkin

Mitsch's natural partial order on the semigroup of binary relations is here characterised by equations in the theory of relation algebras. The natural partial order has a complex relationship with the compatible partial order of inclusion,…

Group Theory · Mathematics 2015-07-21 D. G. FitzGerald

A variety of problems emerged investigating electronic circuits, computer devices and cellular automata motivated a number of attempts to create a differential and integral calculus for Boolean functions. In the present article, we extend…

Logic · Mathematics 2016-08-17 Eduardo Mizraji

In this paper, we introduce methods of encoding propositional logic programs in vector spaces. Interpretations are represented by vectors and programs are represented by matrices. The least model of a definite program is computed by…

Artificial Intelligence · Computer Science 2018-11-29 Chiaki Sakama , Hien D. Nguyen , Taisuke Sato , Katsumi Inoue

We study pseudorandomness and pseudorandom generators from the perspective of logical definability. Building on results from ordinary derandomization and finite model theory, we show that it is possible to deterministically construct, in…

Logic in Computer Science · Computer Science 2023-04-25 Jan Dreier , Jamie Tucker-Foltz

Due to the works of S. Bozapalidis and A. Alexandrakis, there is a well-known characterization of recognizable weighted tree languages over fields in terms of finite-dimensionality of syntactic vector spaces. Here we prove a…

Formal Languages and Automata Theory · Computer Science 2025-09-19 Zoltán Fülöp , Heiko Vogler

Stanley's inequalities for partially ordered sets establish important log-concavity relations for sequences of linear extensions counts. Their extremals however, i.e., the equality cases of these inequalities, were until now poorly…

Combinatorics · Mathematics 2023-12-01 Zhao Yu Ma , Yair Shenfeld

We extend the definitions of upper and lower valuations on partially ordered sets, and consider the metrics they induce, in particular the metrics available (or not) based on the logarithms of such valuations. Motivating applications in…

Combinatorics · Mathematics 2009-03-17 Chris Orum , Cliff A Joslyn

Generalizing supertropical algebras, we present a "layered" structure, "sorted" by a semiring which permits varying ghost layers, and indicate how it is more amenable than the "standard" supertropical construction in factorizations of…

Commutative Algebra · Mathematics 2011-08-16 Zur Izhakian , Manfred Knebusch , Louis Rowen

The paper contains an exposition of part of topology using partitions of unity. The main idea is to create variants of the Tietze Extension Theorem and use them to derive classical theorems. This idea leads to a new result generalizing…

General Topology · Mathematics 2008-02-28 Jerzy Dydak

We point out that a sequence of natural numbers is the dimension sequence of a subproduct system if and only if it is the cardinality sequence of a word system (or factorial language). Determining such sequences is, therefore, reduced to a…

Functional Analysis · Mathematics 2020-11-17 Malte Gerhold , Michael Skeide

We propose a modal logic tailored to describe graph transformations and discuss some of its properties. We focus on a particular class of graphs called termgraphs. They are first-order terms augmented with sharing and cycles. Termgraphs…

Logic in Computer Science · Computer Science 2010-03-24 Ph. Balbiani , R. Echahed , A. Herzig

In this paper, we present a propositional sequent calculus containing disjoint copies of classical and intuitionistic logics. We prove a cut-elimination theorem and we establish a relation between this system and linear logic.

Logic · Mathematics 2009-05-12 Karim Nour , Olivier Laurent

The fractional Hamiltonian analysis of 1+1 dimensional field theory is investigated and the fractional Ostrogradski's formulation is obtained. The fractional path integral of both simple harmonic oscillator with an acceleration-squares part…

Mathematical Physics · Physics 2015-06-26 Dumitru Baleanu , Sami I. Muslih , Kenan Tas

We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first…

Logic · Mathematics 2023-06-22 Oleg Kudinov , Victor Selivanov

Semiring semantics evaluates logical statements by values in some commutative semiring K. Random semiring interpretations, induced by a probability distribution on K, generalise random structures, and we investigate here the question of how…

Logic in Computer Science · Computer Science 2022-03-08 Erich Grädel , Hayyan Helal , Matthias Naaf , Richard Wilke

Let [\theta] denote the integer part and {\theta} the fractional part of the real number \theta. For \theta > 1 and {\theta^{1/n}} \neq 0, define M_{\theta}(n) = [1/{\theta^{1/n}}]. The arithmetic function M_{\theta}(n) is eventually…

Number Theory · Mathematics 2014-01-03 Melvyn B. Nathanson

The Terwilliger algebras of association schemes over an arbitrary field $\mathbb{F}$ were called the Terwilliger $\mathbb{F}$-algebras of association schemes in [8]. In this paper, we study the Terwilliger $\mathbb{F}$-algebras of factorial…

Combinatorics · Mathematics 2024-03-14 Yu Jiang
‹ Prev 1 8 9 10 Next ›