Related papers: Unifying and generalizing known lower bounds via g…

We present a general construction of a geometric notion of circuit complexity for Gaussian states (both bosonic and fermionic) in terms of Riemannian geometry. We lay out general conditions that a Riemannian metric function on the space of…

Let $G$ be an $n$-node planar graph. In a visibility representation of $G$, each node of $G$ is represented by a horizontal line segment such that the line segments representing any two adjacent nodes of $G$ are vertically visible to each…

The concept of geometric-arithmetic index was introduced in the chemical graph theory recently, but it has shown to be useful. The aim of this paper is to obtain new inequalities involving the geometric-arithmetic index $GA_1$ and…

We reduce the problem of proving deterministic and nondeterministic Boolean circuit size lower bounds to the analysis of certain two-dimensional combinatorial cover problems. This is obtained by combining results of Razborov (1989),…

A central question in General Relativity (GR) is how to determine whether singularities are geometrical properties of spacetime, or simply anomalies of a coordinate system used to parameterize the spacetime. In particular, it is an open…

The relationship according to which one physical theory encompasses the domain of empirical validity of another is widely known as "reduction." Here it is argued that one popular methodology for showing that one theory reduces to another,…

Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…

We initiate quantitative studies of complexity in (1+1)-dimensional conformal field theories with a view that they provide the simplest setting to find a gravity dual to complexity. Our work pursues a geometric understanding of complexity…

We use the approximation method of Razborov to analyze the locality barrier which arose from the investigation of the hardness magnification approach to complexity lower bounds. Adapting a limitation of the approximation method obtained by…

Sectional curvature bounds are of central importance in the study of Riemannian manifolds, both in smooth differential geometry and in the generalized synthetic setting of Alexandrov spaces. Riemannian metrics along with metric spaces of…

Fine-grained complexity theory is the area of theoretical computer science that proves conditional lower bounds based on the Strong Exponential Time Hypothesis and similar conjectures. This area has been thriving in the last decade, leading…

We present a unified hard-constraint framework for solving geometrically complex PDEs with neural networks, where the most commonly used Dirichlet, Neumann, and Robin boundary conditions (BCs) are considered. Specifically, we first…

This paper extends the concept of generalized polarization tensors (GPTs), which was previously defined for inclusions with homogeneous conductivities, to inhomogeneous conductivity inclusions. We begin by giving two slightly different but…

Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…

This work improves the existing central limit theorems (CLTs) for geometric functionals of Gibbs processes in three aspects. First, we derive a CLT for weakly stabilizing functionals, thereby improving on the previously used assumption of…

Linearity and ramification constraints have been widely used to weaken higher-order (primitive) recursion in such a way that the class of representable functions equals the class of polytime functions. We show that fine-tuning these two…

Graph Neural Networks (GNNs) have become the standard approach for learning and reasoning over relational data, leveraging the message-passing mechanism that iteratively propagates node embeddings through graph structures. While GNNs have…

Different techniques have been used to prove several transference theorems of the form "nontrivial algorithms for a circuit class C yield circuit lower bounds against C". In this survey we revisit many of these results. We discuss how…

According to Kumar's recent surprising result (ToCT'20), a small border Waring rank implies that the polynomial can be approximated as a sum of a constant and a small product of linear polynomials. We prove the converse of Kumar's result…

Generalized mode-coupling theory (GMCT) has recently emerged as a promising first-principles theory to study the poorly understood dynamics of glass-forming materials. Formulated as a hierarchical extension of standard mode-coupling theory…