scholarly journals RANK LOGIC IS DEAD, LONG LIVE RANK LOGIC!

2019 ◽  
Vol 84 (1) ◽  
pp. 54-87
Author(s):  
ERICH GRÄDEL ◽  
WIED PAKUSA
Keyword(s):  
Finite Fields ◽  
Polynomial Time ◽  
Expressive Power ◽  
Matrix Rank ◽  
Original Definition ◽  
The Matrix ◽  
Prime Fields ◽  
Solvability Problem ◽  
Image Position ◽  
Open Question

AbstractMotivated by the search for a logic for polynomial time, we study rank logic (FPR) which extends fixed-point logic with counting (FPC) by operators that determine the rank of matrices over finite fields. WhileFPRcan express most of the known queries that separateFPCfromPtime, almost nothing was known about the limitations of its expressive power.In our first main result we show that the extensions ofFPCby rank operators over different prime fields are incomparable. This solves an open question posed by Dawar and Holm and also implies that rank logic, in its original definition with a distinct rank operator for every field, fails to capture polynomial time. In particular we show that the variant of rank logic${\text{FPR}}^{\text{*}}$with an operator that uniformly expresses the matrix rank over finite fields is more expressive thanFPR.One important step in our proof is to consider solvability logicFPSwhich is the analogous extension ofFPCby quantifiers which express the solvability problem for linear equation systems over finite fields. Solvability logic can easily be embedded into rank logic, but it is open whether it is a strict fragment. In our second main result we give a partial answer to this question: in the absence of counting, rank operators are strictly more expressive than solvability quantifiers.

scholarly journals The Computational Complexity of Some Problems of Linear Algebra

1996 ◽  
Vol 3 (33) ◽  
Author(s):  
Jonathan F. Buss ◽  
Gudmund Skovbjerg Frandsen ◽  
Jeffery O. Shallit
Keyword(s):  
Computational Complexity ◽  
Commutative Ring ◽  
Linear Algebra ◽  
Polynomial Time ◽  
Matrix Rank ◽  
Maximum Rank ◽  
The Matrix ◽  
Np Complete

We consider the computational complexity of some problems dealing with matrix rank.<br /> Let E, S be subsets of a commutative ring R.<br />Let x1, x2, ..., xt be variables. Given a matrix M = M(x1, x2, ..., xt)<br />with entries chosen from E union {x1, x2, ..., xt}, we want to determine<br />maxrankS(M) = max rank M(a1, a2, ... , at)<br />and<br />minrankS(M) = min rank M(a1, a2, ..., at). <br />There are also variants of these problems that specify more about the<br />structure of M, or instead of asking for the minimum or maximum rank, <br />ask if there is some substitution of the variables that makes the matrix<br /> invertible or noninvertible.<br />Depending on E, S, and on which variant is studied, the complexity<br />of these problems can range from polynomial-time solvable to random<br />polynomial-time solvable to NP-complete to PSPACE-solvable to<br />unsolvable.

scholarly journals FRAGMENTS OF APPROXIMATE COUNTING

2014 ◽  
Vol 79 (2) ◽  
pp. 496-525 ◽  
Author(s):  
SAMUEL R. BUSS ◽  
LESZEK ALEKSANDER KOŁODZIEJCZYK ◽  
NEIL THAPEN
Keyword(s):  
Polynomial Time ◽  
Open Problem ◽  
Bounded Arithmetic ◽  
Pigeonhole Principle ◽  
Approximate Counting ◽  
Image Position

AbstractWe study the long-standing open problem of giving $\forall {\rm{\Sigma }}_1^b$ separations for fragments of bounded arithmetic in the relativized setting. Rather than considering the usual fragments defined by the amount of induction they allow, we study Jeřábek’s theories for approximate counting and their subtheories. We show that the $\forall {\rm{\Sigma }}_1^b$ Herbrandized ordering principle is unprovable in a fragment of bounded arithmetic that includes the injective weak pigeonhole principle for polynomial time functions, and also in a fragment that includes the surjective weak pigeonhole principle for FPNP functions. We further give new propositional translations, in terms of random resolution refutations, for the consequences of $T_2^1$ augmented with the surjective weak pigeonhole principle for polynomial time functions.

scholarly journals Copyful Streaming String Transducers

2021 ◽  
Vol 178 (1-2) ◽  
pp. 59-76
Author(s):  
Emmanuel Filiot ◽  
Pierre-Alain Reynier
Keyword(s):  
Polynomial Time ◽  
Equivalence Problem ◽  
Expressive Power ◽  
The Other ◽  
Finite State Automata ◽  
Finite State ◽  
Variable Content ◽  
Deterministic Automata ◽  
Intermediate Output ◽  
Linear Manner

Copyless streaming string transducers (copyless SST) have been introduced by R. Alur and P. Černý in 2010 as a one-way deterministic automata model to define transductions of finite strings. Copyless SST extend deterministic finite state automata with a set of variables in which to store intermediate output strings, and those variables can be combined and updated all along the run, in a linear manner, i.e., no variable content can be copied on transitions. It is known that copyless SST capture exactly the class of MSO-definable string-to-string transductions, and are as expressive as deterministic two-way transducers. They enjoy good algorithmic properties. Most notably, they have decidable equivalence problem (in PSpace). On the other hand, HDT0L systems have been introduced for a while, the most prominent result being the decidability of the equivalence problem. In this paper, we propose a semantics of HDT0L systems in terms of transductions, and use it to study the class of deterministic copyful SST. Our contributions are as follows: (i)HDT0L systems and total deterministic copyful SST have the same expressive power, (ii)the equivalence problem for deterministic copyful SST and the equivalence problem for HDT0L systems are inter-reducible, in quadratic time. As a consequence, equivalence of deterministic SST is decidable, (iii)the functionality of non-deterministic copyful SST is decidable, (iv)determining whether a non-deterministic copyful SST can be transformed into an equivalent non-deterministic copyless SST is decidable in polynomial time.

scholarly journals Calculating the Energy Spectrum of Complex Low-Dimensional Heterostructures in the Electric Field

2013 ◽  
Vol 2013 ◽  
pp. 1-7
Author(s):  
Svetlana N. Khonina ◽  
Sergey G. Volotovsky ◽  
Sergey I. Kharitonov ◽  
Nikolay L. Kazanskiy
Keyword(s):  
Steady State ◽  
Electric Field ◽  
Ground State ◽  
State Energy ◽  
Airy Functions ◽  
Piecewise Constant ◽  
Matrix Rank ◽  
The Matrix ◽  
Constant Potential ◽  
Low Dimensional

An algorithm for solving the steady-state Schrödinger equation for a complex piecewise-constant potential in the presence of theE-field is developed and implemented. The algorithm is based on the consecutive matching of solutions given by the Airy functions at the band boundaries with the matrix rank increasing by no more than two orders, which enables the characteristic solution to be obtained in the convenient form for search of the roots. The algorithm developed allows valid solutions to be obtained for the electric field magnitudes larger than the ground-state energy level, that is, when the perturbation method is not suitable.

scholarly journals Construction of elliptic curves with cyclic groups over prime fields

2006 ◽  
Vol 73 (2) ◽  
pp. 245-254 ◽  
Author(s):  
Naoya Nakazawa
Keyword(s):  
Elliptic Curves ◽  
Finite Fields ◽  
Function Field ◽  
Modular Group ◽  
Modular Function ◽  
Invariant Function ◽  
Rational Points ◽  
Modular Invariant ◽  
Cyclic Groups ◽  
Prime Fields

The purpose of this article is to construct families of elliptic curves E over finite fields F so that the groups of F-rational points of E are cyclic, by using a representation of the modular invariant function by a generator of a modular function field associated with the modular group Γ0(N), where N = 5, 7 or 13.

Trace Forms on Lie Algebras

1962 ◽  
Vol 14 ◽  
pp. 553-564 ◽  
Author(s):  
Richard Block
Keyword(s):  
Lie Algebra ◽  
Lie Algebras ◽  
Bilinear Form ◽  
Symmetric Bilinear Form ◽  
Trace Form ◽  
Finite Degree ◽  
Trace Forms ◽  
Matrix Products ◽  
The Matrix ◽  
Image Position

If L is a Lie algebra with a representation Δ a→aΔ (a in L) (of finite degree), then by the trace form f = fΔ of Δ is meant the symmetric bilinear form on L obtained by taking the trace of the matrix products:Then f is invariant, that is, f is symmetric and f(ab, c) — f(a, bc) for all a, b, c in L. By the Δ-radical L⊥ = L⊥ of L is meant the set of a in L such that f(a, b) = 0 for all b in L. Then L⊥ is an ideal and f induces a bilinear form , called a quotient trace form, on L/L⊥. Thus an algebra has a quotient trace form if and only if there exists a Lie algebra L with a representation Δ such that

Can the Number of D Electrons in Transition Metals be Measured from White Lines?

1997 ◽  
Vol 3 (S2) ◽  
pp. 957-958 ◽  
Author(s):  
P. Rez
Keyword(s):  
Transition Metals ◽  
Energy Loss ◽  
Electron Energy ◽  
Transition Elements ◽  
White Line ◽  
Line Intensities ◽  
Continuum Region ◽  
The Matrix ◽  
Image Position ◽  
Electron Energy Loss

Sharp peaks at threshold are a prominent feature of the L23 electron energy loss edges of both first and second row transition elements. Their intensity decreases monotonically as the atomic number increases across the period. It would therefore seem likely that the number of d electrons at a transition metal atom site and any variation with alloying could be measured from the L23 electron energy loss spectrum. Pearson measured the white line intensities for a series of both 3d and 4d transition metals. He normalised the white line intensity to the intensity in a continuum region 50eV wide starting 50eV above threshold. When this normalised intensity was plotted against the number of d electrons assumed for each elements he obtained a monotonie but non linear variation. The energy loss spectrum is given bywhich is a product of p<,the density of d states, and the matrix elements for transitions between 2p and d states.

Refinements of Vaught's normal from theorem

1979 ◽  
Vol 44 (3) ◽  
pp. 289-306 ◽  
Author(s):  
Victor Harnik
Keyword(s):  
Normal Form ◽  
Boolean Combination ◽  
Form Theorem ◽  
Central Notion ◽  
The Matrix ◽  
Normal Form Theorem ◽  
Skolem Theorem ◽  
Image Position ◽  
Countable Models

The central notion of this paper is that of a (conjunctive) game-sentence, i.e., a sentence of the formwhere the indices ki, ji range over given countable sets and the matrix conjuncts are, say, open -formulas. Such game sentences were first considered, independently, by Svenonius [19], Moschovakis [13]—[15] and Vaught [20]. Other references are [1], [3]—[5], [10]—[12]. The following normal form theorem was proved by Vaught (and, in less general forms, by his predecessors).Theorem 0.1. Let L = L0(R). For every -sentence ϕ there is an L0-game sentence Θ such that ⊨′ ∃Rϕ ↔ Θ.(A word about the notations: L0(R) denotes the language obtained from L0 by adding to it the sequence R of logical symbols which do not belong to L0; “⊨′α” means that α is true in all countable models.)0.1 can be restated as follows.Theorem 0.1′. For every-sentence ϕ there is an L0-game sentence Θ such that ⊨ϕ → Θ and for any-sentence ϕ if ⊨ϕ → ϕ and L′ ⋂ L ⊆ L0, then ⊨ Θ → ϕ.(We sketch the proof of the equivalence between 0.1 and 0.1′.0.1 implies 0.1′. This is obvious once we realize that game sentences and their negations satisfy the downward Löwenheim-Skolem theorem and hence, ⊨′α is equivalent to ⊨α whenever α is a boolean combination of and game sentences.

Register machine proof of the theorem on exponential diophantine representation of enumerable sets

1984 ◽  
Vol 49 (3) ◽  
pp. 818-829 ◽  
Author(s):  
J. P. Jones ◽  
Y. V. Matijasevič
Keyword(s):  
Natural Number ◽  
Polynomial Time ◽  
Simple Proof ◽  
Diophantine Equations ◽  
Polynomial Equation ◽  
Exponential Diophantine Equations ◽  
Recursively Enumerable ◽  
Image Position ◽  
The Right ◽  
Exponential Relation

The purpose of the present paper is to give a new, simple proof of the theorem of M. Davis, H. Putnam and J. Robinson [1961], which states that every recursively enumerable relation A(a1, …, an) is exponential diophantine, i.e. can be represented in the formwhere a1 …, an, x1, …, xm range over natural numbers and R and S are functions built up from these variables and natural number constants by the operations of addition, A + B, multiplication, AB, and exponentiation, AB. We refer to the variables a1,…,an as parameters and the variables x1 …, xm as unknowns.Historically, the Davis, Putnam and Robinson theorem was one of the important steps in the eventual solution of Hilbert's tenth problem by the second author [1970], who proved that the exponential relation, a = bc, is diophantine, and hence that the right side of (1) can be replaced by a polynomial equation. But this part will not be reproved here. Readers wishing to read about the proof of that are directed to the papers of Y. Matijasevič [1971a], M. Davis [1973], Y. Matijasevič and J. Robinson [1975] or C. Smoryński [1972]. We concern ourselves here for the most part only with exponential diophantine equations until §5 where we mention a few consequences for the class NP of sets computable in nondeterministic polynomial time.

On a Normal Form of the Orthogonal Transformation III

1958 ◽  
Vol 1 (3) ◽  
pp. 183-191 ◽  
Author(s):  
Hans Zassenhaus
Keyword(s):  
Normal Form ◽  
Linear Space ◽  
Bilinear Form ◽  
Matrix Equation ◽  
Orthogonal Transformation ◽  
The Matrix ◽  
Image Position

Under the assumptions of case of theorem 1 we derive from (3.32) the matrix equationso that there corresponds the matrix B to the bilinear form4.1on the linear space4.2and fP,μ, is symmetric if ɛ = (-1)μ+1, anti-symmetric if ɛ = (-1)μ.The last statement remains true in the case a) if P is symmetric irreducible because in that case fP,μ is 0.

Sign in / Sign up

Export Citation Format

Share Document