Publications related to Proof theory

A PCP Theorem for Interactive Proofs and Applications

The celebrated PCP Theorem states that any language in NP can be decided via a verifier that reads O(1) bits from a polynomially long proof. Interactive oracle proofs (IOP), a generalization of PCPs, allow the verifier to interact with the prover for multi ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

On the robustness of the metric dimension of grid graphs to adding a single edge

Patrick Thiran, Gergely Odor, Satvik Mehul Mashkaria

The metric dimension (MD) of a graph is a combinatorial notion capturing the minimum number of landmark nodes needed to distinguish every pair of nodes in the graph based on graph distance. We study how much the MD can increase if we add a single edge to t ...

2022

On the Power and Limitations of Branch and Cut

Mika Tapani Göös

The Stabbing Planes proof system [Paul Beame et al., 2018] was introduced to model the reasoning carried out in practical mixed integer programming solvers. As a proof system, it is powerful enough to simulate Cutting Planes and to refute the Tseitin formu ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2021

A comment on performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid

Maryam Kamgarpour, Baiwei Guo, Orcun Karaca

We provide a counterexample to the performance guarantee obtained in the paper "Il'ev, V., Linker, N., 2006. Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid", which was published in Volume 171 of the Eur ...

ELSEVIER2021

Computation of Al-Salam Carlitz and Askey-Wilson moments using Motzkin paths

Gaspard Ohlmann

In this paper we study the moments of polynomials from the Askey scheme, and we focus on Askey-Wilson polynomials. More precisely, we give a combinatorial proof for the case where d = 0. Their values have already been computed by Kim and Stanton in 2015, h ...

ELECTRONIC JOURNAL OF COMBINATORICS2021

A dependence of the cost of fast controls for the heat equation on the support of initial datum

Hoài-Minh Nguyên

The controllability cost for the heat equation as the control time

T

goes to 0 is well-known of the order

e^{C/T}

for some positive constant

C

, depending on the controlled domain and for all initial datum. In this paper, we prove that the constant $C ...

2021

Mutual information for low-rank even-order symmetric tensor estimation

Nicolas Macris, Jean François Emmanuel Barbier, Clément Dominique Luneau

We consider a statistical model for finite-rank symmetric tensor factorization and prove a single-letter variational expression for its asymptotic mutual information when the tensor is of even order. The proof applies the adaptive interpolation method orig ...

OXFORD UNIV PRESS2021

Proof Of Concept Of A Graphene-Based Resonant Accelerometer

Luis Guillermo Villanueva Torrijo, Daniel Moreno Garcia

Acceleration measurements are fundamental in applications such as consumer electronics, navigation, automotive safety and Internet of things (IoT). In comparison with capacitive or piezoresistive MEMS accelerometers, resonant graphene accelerometers have t ...

IEEE2021

Critical role of H-aggregation for high-efficiency photoinduced charge generation in pristine pentamethine cyanine salts

Jacques-Edouard Moser, Frank Nüesch, George Cameron Fish, Juan Manuel Moreno Naranjo

The mechanism of photoinduced symmetry-breaking charge separation in solid cyanine salts at the base of organic photovoltaic and optoelectronic devices is still debated. Here, we employ femtosecond transient absorption spectroscopy (TAS) to monitor the cha ...

2021

All-Polymer Printed Low-Cost Regenerative Nerve Cuff Electrodes

Silvestro Micera

Neural regeneration after lesions is still limited by several factors and new technologies are developed to address this issue. Here, we present and test in animal models a new regenerative nerve cuff electrode (RnCE). It is based on a novel low-cost fabri ...

FRONTIERS MEDIA SA2021

Proof theory

Graph Chatbot

Chat with Graph Search

A PCP Theorem for Interactive Proofs and Applications

On the robustness of the metric dimension of grid graphs to adding a single edge

On the Power and Limitations of Branch and Cut

A comment on performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid

Computation of Al-Salam Carlitz and Askey-Wilson moments using Motzkin paths

A dependence of the cost of fast controls for the heat equation on the support of initial datum

Mutual information for low-rank even-order symmetric tensor estimation

Proof Of Concept Of A Graphene-Based Resonant Accelerometer

Critical role of H-aggregation for high-efficiency photoinduced charge generation in pristine pentamethine cyanine salts

All-Polymer Printed Low-Cost Regenerative Nerve Cuff Electrodes

Computation of Al-Salam Carlitz and Askey-Wilson moments using Motzkin paths

A PCP Theorem for Interactive Proofs and Applications

Critical role of H-aggregation for high-efficiency photoinduced charge generation in pristine pentamethine cyanine salts

Proof Of Concept Of A Graphene-Based Resonant Accelerometer

On the Power and Limitations of Branch and Cut

Mutual information for low-rank even-order symmetric tensor estimation

All-Polymer Printed Low-Cost Regenerative Nerve Cuff Electrodes

On the robustness of the metric dimension of grid graphs to adding a single edge

A comment on performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid

A dependence of the cost of fast controls for the heat equation on the support of initial datum