English
Related papers

Related papers: Multi-Solid Varieties and Mh-Transducers

200 papers

The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…

Combinatorics · Mathematics 2012-05-01 Felix Breuer , Aaron Dall , Martina Kubitzke

We consider a class of finite state three-tape transducers which models the operation of shuffling and splitting words. We present them as automata over the so-called Shuffling Monoid. These automata can be seen as either shufflers or…

Formal Languages and Automata Theory · Computer Science 2024-07-04 Ignacio Mollo Cunningham

Multidimensional systems are becoming increasingly important as they provide a promising tool for estimation, simulation and control, while going beyond the traditional setting of one-dimensional systems. The analysis of multidimensional…

Systems and Control · Computer Science 2018-05-08 Philippe Dreesen , Kim Batselier , Bart De Moor

We give a characterization of finite sets of triples of elements (e.g., positive integers) that can be colored with two colors such that for every element $i$ in each color class there exists a triple which does not contain $i$. We give a…

Combinatorics · Mathematics 2020-08-24 Balázs Keszegh

Let $(G,\pmb{+})$ be any given semimodule over a discrete semiring $(R,+,\cdot)$ with a finite coloring, say $G=B_1\cup\dotsm\cup B_q$. By establishing a Regional Multiple Recurrence Theorem for semimodules, we prove that one of the colors…

Dynamical Systems · Mathematics 2018-09-17 Xiongping Dai

Assuming the K\"unneth type standard conjecture, we propose a way to describe objects of mixed motives explicitly. We study their formal properties, and we associate mixed motives to schemes smooth and separated over a field. This serves as…

Algebraic Geometry · Mathematics 2020-01-31 Doosung Park

In this paper, we generalize the concept of complete coloring and achromatic number to 2-edge-colored graphs and signed graphs. We give some useful relationships between different possible definitions of such achromatic numbers and prove…

Combinatorics · Mathematics 2019-02-14 Dimitri Lajou

The paper introduces and studies the notions of Lipschitzian and H\"olderian full stability of solutions to three-parametric variational systems described in the generalized equation formalism involving nonsmooth base mappings and partial…

Optimization and Control · Mathematics 2017-08-23 Boris S. Mordukhovich , Tran T. A. Nghia , Dat T. Pham

Multipoles are the pieces we obtain by cutting some edges of a cubic graph. As a result of the cut, a multipole $M$ has dangling edges with one free end, which we call semiedges. Then, every 3-edge-coloring of a multipole induces a coloring…

Combinatorics · Mathematics 2013-08-05 M. A. Fiol , J. Vilaltella

We introduce higher-order support varieties for pairs of modules over a commutative local complete intersection ring, and give a complete description of which varieties occur as such support varieties. In the context of a group algebra of a…

Commutative Algebra · Mathematics 2015-12-03 Petter Andreas Bergh , David A. Jorgensen

We establish closed-form expansions for the number of colorings of a path or cycle on n vertices with colors from 1,...,x such that adjacent vertices are colored differently or with colors from y+1,...x.

Combinatorics · Mathematics 2012-01-19 Klaus Dohmen

We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…

Logic in Computer Science · Computer Science 2007-05-23 Sabine Glesner , Karl Stroetmann

We prove a homological stability theorem for certain complements of symmetric spaces. This is a variant of a conjecture by Vakil and Matchett Wood for subspaces of $\mathrm{Sym}^n(X)$ where $X$ is an open manifold admitting a boundary. To…

Algebraic Topology · Mathematics 2013-12-24 TriThang Tran

This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats of transition system specifications using Plotkin's…

Logic in Computer Science · Computer Science 2007-05-23 B. Bloom , W. J. Fokkink , R. J. van Glabbeek

In this paper, we explore the interaction between two monoidal structures: a multiplicative one, for the encoding of pairing, and an additive one, for the encoding of choice. We propose a colored PROP to model computation in this framework,…

Logic in Computer Science · Computer Science 2025-05-21 Kostia Chardonnet , Marc de Visme , Benoît Valiron , Renaud Vilmart

We prove that for a given deterministic top-down transducer with look-ahead it is decidable whether or not its translation is definable (1)~by a linear top-down tree transducer or (2)~by a tree homomorphism. We present algorithms that…

Formal Languages and Automata Theory · Computer Science 2021-06-01 Sebastian Maneth , Helmut Seidl , Martin Vu

We settle the complexity of satisfiability, finite-state satisfiability, and model-checking for several fragments of second-order HyperLTL, which extends HyperLTL with quantification over sets of traces: they are all in the analytical…

Logic in Computer Science · Computer Science 2025-09-17 Gaëtan Regaud , Martin Zimmermann

A dimension allowing in particular to state necessary and sufficient conditions of the Morse-Sard Theorem for real valued functions is introduced.

Geometric Topology · Mathematics 2007-05-23 Azat Ainouline

Continuing previous work, this paper focuses on the summability problem of multivariate rational functions in the mixed case in which both shift and $q$-shift operators can appear. Our summability criteria rely on three ingredients…

Symbolic Computation · Computer Science 2026-02-04 Shaoshi Chen , Lixin Du , Hanqian Fang , Yisen Wang

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…

Information Theory · Computer Science 2013-08-28 Pingzhi Yuan , Cunsheng Ding