arXiv Math @arxiv_math@qoto.org

Gentle algebras are a class of special biserial algebra whose representation theory has been thoroughly described. In this paper, we consider the infinite dimensional generalizations of gentle algebras, referred to as locally gentle algebras. We give combinatorial descriptions of the center, spectrum, and homological dimensions of a locally gentle algebra, including an explicit injective resolution. We classify when these algebras are Artin-Schelter Gorenstein, Artin-Schelter regular, and Cohen-Macaulay, and provide an analogue of Stanley's theorem for locally gentle algebras.

Let $R$ be a ring. In \cite{MD4} Mao and Ding defined an special class of $R$-modules that they called \( FP_n \)-projective $R$-modules. In this paper, we give some new characterizations of \( FP_n \)-projective $R$-modules and strong $n$-coherent rings. Some known results are extended and some new characterizations of the \( FP_n \)-injective global dimension in terms of \( FP_n \)-projective $R$-modules are obtained. Using the \( FP_n \)-projective dimension of an $R$-module defined by Ouyang, Duan and Li in \cite{Ouy} we introduce a slightly different \( FP_n \)-projective global dimension over the ring $R$ which measures how far away the ring is from being Noetherian. This dimension agrees with the $(n,0)$-projective global dimension of \cite{Ouy} when the ring in question is strong $n$-coherent.

This study investigates the iterative refinement method applied to the solution of linear discrete inverse problems by considering its application to the Tikhonov problem in mixed precision. Previous works on mixed precision iterative refinement methods for the solution of symmetric positive definite linear systems and least-squares problems have shown regularization to be a key requirement when computing low precision factorizations. For problems that are naturally severely ill-posed, we formulate the iterates of iterative refinement in mixed precision as a filtered solution using the preconditioned Landweber method with a Tikhonov-type preconditioner. Through numerical examples simulating various mixed precision choices, we showcase the filtering properties of the method and the achievement of comparable or superior accuracy compared to results computed in double precision as well as another approximate method.

We study the simplicial volume of manifolds obtained from Davis' reflection group trick, the goal being characterizing those having positive simplicial volume. In particular, we focus on checking whether manifolds in this class with nonzero Euler characteristic have positive simplicial volume (Gromov asked whether this holds in general for aspherical manifolds). This leads to a combinatorial problem about triangulations of spheres: we define a partial order on the set of triangulations -- the relation being the existence of a nonzero-degree simplicial map between two triangulations -- and the problem is to find the minimal elements of a specific subposet. We solve explicitly the case of triangulations of the two-dimensional sphere, and then perform an extensive analysis, with the help of computer searches, of the three-dimensional case. Moreover, we present a connection of this problem with the theory of graph minors.

We survey a number of incompleteness results in operator algebras stemming from the recent undecidability result in quantum complexity theory known as $\operatorname{MIP}^*=\operatorname{RE}$, the most prominent of which is the Gödelian refutation of the Connes Embedding Problem. We also discuss the very recent use of $\operatorname{MIP}^*=\operatorname{RE}$ in refuting the Aldous-Lyons conjecture in probability theory.

Decarbonizing global energy systems requires extensive integration of renewable energy into the electric grid. However, the intermittency and variable nature of wind and other non-dispatchable renewable resources make integration a great challenge. Hybridizing renewables with energy storage to form integrated energy systems (IESs) helps mitigate these concerns by improving reliability and resiliency. This paper systematically studies the limitations of the prevailing price-taker assumption for techno-economic analysis (TEA) and optimization of hybrid energy systems. As an illustrative case study, we retrofit an existing wind farm in the RTS-GMLC test system (which loosely mimics the Southwest U.S.) with battery energy storage to form an IES. We show that the standard price-taker model overestimates the electricity revenue and the net present value (NPV) of the IES up to 178% and 50%, respectively, compared to our more rigorous multiscale optimization. These differences arise because introducing storage creates a more flexible resource that impacts the larger wholesale electricity market. Moreover, this work highlights the impact of the IES has on the market via various strategic bidding, and underscores the importance of moving beyond price-taker for optimal storage sizing and TEA of IESs. We conclude by discussing opportunities to generalize the proposed framework to other IESs, and highlight emerging research questions regarding the complex interactions between IESs and markets.

While much attention of neural network methods is devoted to high-dimensional PDE problems, in this work we consider methods designed to work for elliptic problems on domains $Ω\subset \mathbb{R} ^d, $ $d=1,2,3$ in association with more standard finite elements. We suggest to connect finite elements and neural network approximations through training, i.e., using finite element spaces to compute the integrals appearing in the loss functionals. This approach, retains the simplicity of classical neural network methods for PDEs, uses well established finite element tools (and software) to compute the integrals involved and it gains in efficiency and accuracy. We demonstrate that the proposed methods are stable and furthermore, we establish that the resulting approximations converge to the solutions of the PDE. Numerical results indicating the efficiency and robustness of the proposed algorithms are presented.

Driven by applications in the natural, social and computer sciences several algorithms have been proposed to enumerate all sets $X$ of vertices of a graph $G$ that induce a connected subgraph. Our algorithm AllMetricSets enumerates all $X$'s that induce (more exquisite) metric subgraphs. Here "metric" means that any distinct $s,t\in X$ are joined by a globally shortest $s-t$ path.

Convex programming with linear constraints plays an important role in the operation of a number of everyday systems. However, absent any additional protections, revealing or acting on the solutions to such problems may reveal information about their constraints, which can be sensitive. Therefore, in this paper, we introduce a method for solving convex programs while keeping linear constraints private. First, we prove that this method is differentially private and always generates a feasible optimization problem (i.e., one whose solution exists). Then we show that the solution to the privatized problem also satisfies the original, non-private constraints. Next, we bound the expected loss in performance from privacy, which is measured by comparing the cost with privacy to that without privacy. Simulation results apply this framework to constrained policy synthesis in a Markov decision process, and they show that a typical privacy implementation induces only an approximately $9\%$ loss in solution quality.

In his paper on the Mordell-Lang conjecture, Hrushovski employed techniques from model theory to prove the function field version of the conjecture. In doing so he was able to answer a related question of Voloch, which we refer to henceforth as Hrushovski's theorem. In this paper we shall give an alternative proof of said theorem in the characteristic $p$ setting, but using purely algebro-geometric ideas.

This paper discusses a generalization of virtual knot theory that we call multi-virtual knot theory. Multi-virtual knot theory uses a multiplicity of types of virtual crossings. As we will explain, this multiplicity is motivated by the way it arises first in a graph-theoretic setting in relation to generalizing the Penrose evaluation for colorings of planar trivalent graphs to all trivalent graphs, and later by its uses in a virtual knot theory. As a consequence, the paper begins with the graph theory as a basis for our constructions, and then proceeds to the topology of multi-virtual knots and links. The second section of the paper is a review of our previous work (See arXiv:1511.06844). The reader interested in seeing our generalizations of the original Penrose evaluation, can begin this paper at the beginning and see the graph theory. A reader primarily interested in multi-virtual knots and links can begin reading in section 4 with references to the earlier part of the paper.

Given a graph $G$, its $2$-color Turán number $\mathrm{ex}^{(2)}(n,G)$ is the largest number of edges in an $n$-vertex graph whose edges can be colored with two colors avoiding a monochromatic copy of $G$. Let $π^{(2)}(G)=\lim_{n\to\infty}\mathrm{ex}^{(2)}(n,G)/\binom{n}{2}$ be the $2$-color Turán density of $G$. What real numbers in the interval $(0,1)$ are realized as the $2$-color Turán density of some graph? It is known that $π^{(2)}(G)=1-(R_χ(G)-1)^{-1}$, where $R_χ(G)$ is the chromatic Ramsey number of $G$. However, determining specific values of $R_χ(G)$ is challenging. Burr, Erdős, and Lovász showed that $(k-1)^2+1\leqslant{R_χ(G)}\leqslant{R(k)}$, for any $k$-chromatic graph $G$, where $R(k)$ is the classical Ramsey number. The upper bound here can be attained by a clique and the lower bound is achieved by a graph constructed by Zhu. To the best of our knowledge, there are no other, besides these two, known values of $R_χ(G)$ among $k$-chromatic graphs $G$ for general $k$. In this paper we prove that there are $Ω(k)$ different values of $R_χ(G)$ among $k$-chromatic graphs $G$. In addition, we determine a new value for the chromatic Ramsey numbers of $4$-chromatic graphs. This sheds more light into the possible $2$-color Turán densities of graphs.

Motivated by numerical continuation studies of coupled mechanical oscillators, we investigate branches of localized time-periodic solutions of one-dimensional chains of coupled oscillators. We focus on Ginzburg-Landau equations with nonlinearities of lambda-omega type and establish the existence of on-site and off-site solutions in the case of weak coupling and weak-amplitude dependence of the oscillator periods. Utilizing a core-far-field decomposition, we demonstrate that in-phase solutions lie on branches that exhibit snaking behavior.

Given a matrix model, by combining the Schwinger-Dyson equations with positivity constraints on its solutions, in the large $N$ limit one is able to obtain explicit and numerical bounds on its moments. This technique is known as bootstrapping with positivity. In this paper we use this technique to estimate the critical points and exponents of several matrix multi-models. As a proof of concept, we first show it can be used to find the well-studied quartic single matrix model's critical phenomena. We then apply the method to several similar ``unsolved" 2-matrix models with various quartic interactions. We conjecture and present strong evidence for the string susceptibility exponent for some of these models to be $γ= 1/2$, which heuristically indicates that the continuum limit will likely be the Continuum Random Tree. For the other 2-matrix models, we find estimates of new string susceptibility exponents that may indicate a new continuum limit. We then study an unsolved 3-matrix model that generalizes the 3-colour model with cubic interactions. Additionally, for all of these models, we are able to derive explicitly the first several terms of the free energy in the large $N$ limit as a power series expansion in the coupling constants at zero by exploiting the structure of the Schwinger-Dyson equations.

Let $p\ge 5$ be a prime and let $P$ be a Sylow $p$-subgroup of a finite symmetric group. To every irreducible character of $P$ we associate a collection of labelled, complete $p$-ary trees. The main results of this article describe Sylow branching coefficients for symmetric groups for all irreducible characters of $P$ in terms of some combinatorial properties of these trees, extending previous work on the linear characters of $P$.

In this paper we study monomial cycles in Koszul homology over a monomial ring. The main result is that a monomial cycle is a boundary precisely when the monomial representing that cycle is contained in an ideal we introduce called the boundary ideal. As a consequence, we obtain necessary ideal-theoretic conditions for a monomial ideal to be Golod. We classify Golod monomial ideals in four variables in terms of these conditions. We further apply these conditions to symmetric monomial ideals, allowing us to classify Golod ideals generated by the permutations of one monomial. Lastly, we show that a class of ideals with linear quotients admit a basis for Koszul homology consisting of monomial cycles. This class includes the famous case of stable monomial ideals as well as new cases, such as symmetric shifted ideals.

We develop a theory of derived rigid spaces and quasi-coherent sheaves and analytic crystals on them. Amongst other things, we obtain a six-functor formalism for these quasi-coherent sheaves and analytic crystals. We provide evidence that the category of analytic crystals is related to the theory of D-cap-modules introduced by Ardakov--Wadsley.

We compare the multi-dimensional generalisation of the Aw-Rascle model with the pressureless Euler-alignment system, in which the communication weight is matrix-valued. Our generalisation includes the velocity offset in the form of a gradient of a non-local density function, given by the convolution with a kernel $K$. We investigate connections between these models at the macroscopic, mesoscopic and macroscopic (hydrodynamic) level, and overview the results on the mean-field limit for various assumptions on $K$.

We present natural conjectural generalizations of the `positivity and integrality of mirror maps' phenomenon, encompassing the mirror maps appearing in the Batyrev--Borisov construction of mirror Calabi--Yau complete intersections in Fano toric varieties as a special case. We find that, given the combinatorial data from which one constructs a mirror pair of Calabi--Yau complete intersections, there are two ways of writing down an associated `mirror map': one which is the `true mirror map', meaning the one which appears in mirror symmetry theorems; and one which is the `naive mirror map'. The two are equal under a certain combinatorial criterion which holds e.g. for the quintic threefold, but not in general. We conjecture (based on substantial computer checks, together with proofs under extra hypotheses) that the naive mirror map always has positive integer coefficients, while the true mirror map always has integer (but not necessarily positive) coefficients. Almost all previous works on the integrality of mirror maps concern the naive mirror map, and in particular, only apply to the true mirror map under the combinatorial criterion mentioned above.

We give a new short proof of the classification of rank at least two invariant subvarieties in genus three, which is due to Aulicino, Nguyen, and Wright. The proof uses techniques developed in recent work of Apisa and Wright.