English
Related papers

Related papers: Quantifier-free descriptions for quantifier soluti…

200 papers

A new ansatz is presented for a Lax pair describing systems of particles on the line interacting via (possibly nonsymmetric) pairwise forces. Particular cases of this yield the known Lax pairs for the Calogero-Moser and Toda systems, as…

High Energy Physics - Theory · Physics 2008-02-03 H. W. Braden , V. M. Buchstaber

We present a novel parsing algorithm for all context-free languages, based on computing the relation between configurations and reaching transitions in a recursive transition network. Parsing complexity w.r.t. input length matches the state…

Formal Languages and Automata Theory · Computer Science 2019-02-19 Grzegorz Herman

We consider rational power series over an alphabet $\Sigma$ with coefficients in a ordered commutative semiring $K$ and characterize them as the free ordered $K$-semialgebras in various classes of ordered $K$-semialgebras equipped with a…

Formal Languages and Automata Theory · Computer Science 2011-02-24 Zoltan Esik , Werner Kuich

We study sets $E(\Sigma,q)=\left\{\sum_{i=1}^\infty \sigma_iq^i\colon(\sigma_i)\in\Sigma^{\mathbb N}\right\}$ for a finite set $\Sigma\subset \mathbb R$ and $q\in(0,1)$. Under the assumption $q|\Sigma|=1$ we prove several new equivalent…

General Topology · Mathematics 2025-08-28 Szymon Głąb , Mateusz Kula

We present several enumeration results holding in sets of words called neutral and which satisfy restrictive conditions on the set of possible extensions of nonempty words. These formulae concern return words and bifix codes. They…

Discrete Mathematics · Computer Science 2015-03-23 Francesco Dolce , Dominique Perrin

For a terminal alphabet $\Sigma$ and an attribute alphabet $\Gamma$, a $(\Sigma, \Gamma)$-extractor is a function that maps every string over $\Sigma$ to a table with a column per attribute and with sets of positions of $w$ as cell entries.…

Formal Languages and Automata Theory · Computer Science 2026-03-18 Markus L. Schmid

Quantitative algebras (QAs) are algebras over metric spaces defined by quantitative equational theories as introduced by the same authors in a related paper presented at LICS 2016. These algebras provide the mathematical foundation for…

Logic in Computer Science · Computer Science 2018-04-06 Radu Mardare , Prakash Panangaden , Gordon Plotkin

Motivated by satisfiability of constraints with function symbols, we consider numerical inequalities on non-negative integers. The constraints we consider are a conjunction of a linear system Ax = b and a conjunction of (non-)convex…

Logic in Computer Science · Computer Science 2022-10-21 Rodrigo Raya , Jad Hamza , Viktor Kunčak

Consider a linear system of equations with interval coefficients, and each interval coefficient is associated with either a universal or an existential quantifier. The AE solution set and AE solvability of the system is defined by…

Numerical Analysis · Computer Science 2019-05-28 Milan Hladík

The procedure of the "quantum" linearization of the Hamiltonian ordinary differential equations with one degree of freedom is introduced. It is offered to be used for the classification of integrable equations of the Painleve type. By this…

Exactly Solvable and Integrable Systems · Physics 2013-03-15 Bulat Suleimanov

We consider dynamical systems on the space of functions taking values in a free associative algebra. The system is said to be integrable if it possesses an infinite dimensional Lie algebra of commuting symmetries. In this paper we propose a…

Exactly Solvable and Integrable Systems · Physics 2021-10-20 Alexander V. Mikhailov

The formalism of classical and quantum mechanics on phase space leads to symplectic and Heisenberg group representations, respectively. The Wigner functions give a representation of the quantum system using classical variables. The…

Quantum Physics · Physics 2007-05-23 Ajay Patwardhan

This paper presents a framework to derive instantiation-based decision procedures for satisfiability of quantified formulas in first-order theories, including its correctness, implementation, and evaluation. Using this framework we derive…

Logic in Computer Science · Computer Science 2016-02-12 Andrew Reynolds , Tim King , Viktor Kuncak

We study universally valid uncertainty relations in general quantum systems described by general $\sigma$-finite von Neumann algebras to foster developing quantitative analysis in quantum systems with infinite degrees of freedom such as…

Quantum Physics · Physics 2018-09-14 Kazuya Okamura , Masanao Ozawa

We consider a hierarchy of the natural type Hamiltonian systems of $n$ degrees of freedom with polynomial potentials separable in general ellipsoidal and general paraboloidal coordinates. We give a Lax representation in terms of $2\times 2$…

High Energy Physics - Theory · Physics 2009-10-22 J. C. Eilbeck , V. Z. Enol'skii , Vadim B. Kuznetsov , A. V. Tsiganov

We review and systematize recent attempts to canonically quantize general relativity in 2+1 dimensions, defined on space-times $\R\times\Sigma^g$, where $\Sigma^g$ is a compact Riemann surface of genus $g$. The emphasis is on quantizations…

General Relativity and Quantum Cosmology · Physics 2010-11-01 R. Loll

A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…

Logic in Computer Science · Computer Science 2011-07-08 Emmanuel Beffara

We extend the previous series of articles [HPA] devoted to finding mappings between the Weinberg-Tucker-Hammer formalism and antisymmetric tensor fields. Now we take into account solutions of different parities of the Weinberg-like…

High Energy Physics - Theory · Physics 2007-05-23 Valeri V. Dvoeglazov

We describe a solution of the word problem in free fields (coming from non-commutative polynomials over a commutative field) using elementary linear algebra, provided that the elements are given by minimal linear representations. It relies…

Rings and Algebras · Mathematics 2018-08-06 Konrad Schrempf

This article proposes a new index for quantifying the degree of dependence between random vectors. The index takes values in [0,1] and equals zero if and only if the random vectors are sub-independent. Unlike mere uncorrelatedness,…

Statistics Theory · Mathematics 2026-05-19 Chuancun yin
‹ Prev 1 4 5 6 7 8 10 Next ›