Related papers: Infinite circuits are easy. How about long ones?
In this paper, we consider reflected anticipated backward stochastic differential equations (RABSDEs, for short) with an additional resistance in the generators. Firstly, we study the existence and uniqueness results. In Luo (2020), the…
We consider the so called Calder\'on problem which corresponds to the determination of a conductivity appearing in an elliptic equation from boundary measurements. Using several known results we propose a simplified and self contained proof…
We study the nonlinear behaviors of mass-spring systems damped by dry friction using simulation by a nonlinear LC circuit damped by anti-parallel diodes. We show that the differential equation for the electric oscillator is equivalent to…
An instance of Hamiltonian cycle problem can be solved by converting it to an instance of Travelling salesman problem, assigning any choice of weights to edges of the underlying graph. In this note we demonstrate that, for difficult…
Circuits are fundamental objects in linear programming and oriented matroid theory, representing the elementary difference vectors of a polyhedron between points in its affine space. A recent concept introduced by Ekbatani, Natura, and…
Random quantum circuits have been utilized in the contexts of quantum supremacy demonstrations, variational quantum algorithms for chemistry and machine learning, and blackhole information. The ability of random circuits to approximate any…
The behavior of a linear oscillator under the action of an external almost periodic force is investigated. The constructed solutions grow more slowly than the resonant ones. The dependence of the amplitude of growing solutions on the…
Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…
We prove the existence of recurrent initial configurations for the rotor walk on many graphs, including Z^d, and planar graphs with locally finite embeddings. We also prove that recurrence and transience of rotor walks are invariant under…
The non-linear current-voltage characteristic of a tunnel junction between two Luttinger systems is calculated for an interaction with finite range. Coulomb blockade features are found. The dissipative resistance, the capacitance and the…
We study equilibrium configurations of infinitely many identical particles on the real line or finitely many particles on the circle, such that the (repelling) force they exert on each other depends only on their distance. The main question…
We consider the following problem: given $d \times d$ rational matrices $A_1, \ldots, A_k$ and a polyhedral cone $\mathcal{C} \subset \mathbb{R}^d$, decide whether there exists a non-zero vector whose orbit under multiplication by $A_1,…
A resistance network is a connected graph $(G,c)$. The conductance function $c_{xy}$ weights the edges, which are then interpreted as conductors of possibly varying strengths. The Dirichlet energy form $\mathcal E$ produces a Hilbert space…
We argue that the quantum-theoretical structures studied in several recent lines of research cannot be adequately described within the standard framework of quantum circuits. This is in particular the case whenever the combination of…
The persistent current of correlated electrons in a continuous one-dimensional ring with a single scatterer is calculated by solving the many-body Schrodinger equation for several tens of electrons interacting via the electron-electron…
In this article, we study "questionable representations" of (partial or total) orders, introduced in our previous article "A class of orders with linear? time sorting algorithm". (Later, we consider arbitrary binary functional/relational…
In an alternating-current network, each edge has a complex "conductance" with positive real part. The response map is the linear map from the vector of voltages at a subset of "boundary nodes" to the vector of currents flowing into the…
A repetition free Longest Common Subsequence (LCS) of two sequences x and y is an LCS of x and y where each symbol may appear at most once. Let R denote the length of a repetition free LCS of two sequences of n symbols each one chosen…
We prove that the orbit closure of the determinant is not normal. A similar result is obtained for the orbit closure of the permanent multiplied by a power of a linear form.
Inspired by Solomonoffs theory of inductive inference, we propose a prior based on circuit complexity. There are several advantages to this approach. First, it relies on a complexity measure that does not depend on the choice of UTM. There…