arXiv subjects

Sayantan Roy

Publications and source records attributed to Sayantan Roy.

18 recordsLinked to original sources

arXiv2026

Finite temperature precursors of Mottness in the Fermi Hubbard model

We investigate finite-temperature precursors of Mottness in the repulsive Hubbard model above the spin-ordering temperature, using numerically exact determinant quantum Monte Carlo. We show that the finite-temperature crossover is accompanied by a pronounced suppression of charge fluctuations, despite the presence of a gapless single-particle spectra, demonstrating that Mottness first emerges via two-particle response in an anomalous metallic regime, before appearing in single-particle spectral functions. We further show that a gap formation in the density of states occurs through momentum-resolved redistribution of spectral weight across the Brillouin zone, that begins at the onset of anomalous metallic regime, rather than through gap formation in single-particle spectral functions at individual momenta. Upon doping, the anomalous-metallic regime generates transport and spectroscopic signatures characteristic of doped Mott insulators. This shows that the transport and spectroscopic anomalies of the doped Hubbard model do not require the presence of a fully formed Mott insulator at half-filling, but instead originate from the strong charge-response renormalization and spectral-weight redistribution that develop within the precursor anomalous metallic regime at half-filling.

cond-mat.str-el↗

arXiv2026

Quantum Relative-alpha-Entropies: A Structural and Geometric Perspective

Most quantum divergences derive their structure from classical f-divergences or Renyi-type constructions, a dependence that obscures several quantum geometric effects. We introduce a quantum relative-alpha-entropy that extends Umegaki's relative entropy while falling outside the f-divergence class. The proposed divergence exhibits a nonlinear convexity property, which yields a generalized convexity result for the Petz-Renyi divergence for alpha greater than one, complementing the known convexity for alpha less than one. It is additive under tensor products, invariant under unitary transformations, and depends only on the relative geometry of quantum states rather than their absolute magnitudes. Using Nussbaum-Szkola-type distributions, we also establish an exact correspondence of this divergence with classical relative-alpha-entropy. This reveals relative-alpha-entropy as a fundamentally geometric notion of quantum distinguishability not captured by existing divergence frameworks.

quant-ph↗

arXiv2025

Diophantine approximation with primes from short intervals

In this paper, we establish hybrid results on Diophantine approximation with primes from short intervals. In particular, we prove the following result in a slightly modified form: If $\alpha$ is an irrational number having a continued fraction expansion with bounded terms (in particular, if $\alpha$ is a quadratic irrational), then the number of primes $p$ in the interval $(X-Y,X]$ satisfying $||p\alpha||<\delta$ is asymptotically equal to $2\delta Y/\log X$, provided that $X\ge 10$, $X^{2/3+\varepsilon}\le Y\le X/2$ and $X^{\varepsilon}\max\left\{X^{1/4}Y^{-1/2},X^{2/3}Y^{-1}\right\}\le \delta\le 1/2$.

math.NT↗

arXiv2025

Generalized Explosion Principles: A Semantic Perspective

This article is motivated by the fact that there is a distinction between the descriptions of logical explosion from syntactic and semantic points of view. The discussion is illustrated using the concept of abstract model structures and the notions of satisfiability and finite satisfiability in these structures. Various principles of explosion have been described in terms of unsatisfiability or finite unsatisfiability. The semantic analogues of the principles of explosion introduced in [3] have also been considered among these. The article also studies the characterizations of and the interconnections between these new principles of explosion.

math.LO↗

arXiv2025

Abstract Model Structures and Compactness Theorems

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the syntactic/semantic particularities of the corresponding logic. In this paper, using the notion of \emph{abstract model structures}, we show that one can develop a generalized notion of compactness that is independent of these. Several characterization theorems for a particular class of compact abstract model structures are also proved.

math.LO↗

arXiv2024

Relational Companions of Logics

The variable inclusion companions of logics have lately been thoroughly studied by multiple authors. There are broadly two types of these companions: the left and the right variable inclusion companions. Another type of companions of logics induced by Hilbert-style presentations (Hilbert-style logics) were introduced in a recent paper. A sufficient condition for the restricted rules companion of a Hilbert-style logic to coincide with its left variable inclusion companion was proved there, while a necessary condition remained elusive. The present article has two parts. In the first part, we give a necessary and sufficient condition for the left variable inclusion and the restricted rules companions of a Hilbert-style logic to coincide. In the rest of the paper, we recognize that the variable inclusion restrictions used to define variable inclusion companions of a logic $\langle\mathcal{L},\vdash\rangle$ are relations from $\mathcal{P}(\mathcal{L})$ to $\mathcal{L}$. This leads to a more general idea of a relational companion of a logical structure, a framework that we borrow from the field of universal logic. We end by showing that even Hilbert-style logics and the restricted rules companions of these can be brought under the umbrella of the general notions of logical structures and their relational companions that are discussed here.

math.LO↗

arXiv2024

Rule-Elimination Theorems

Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen's proof of the cut-elimination theorem for the system $\mathbf{LK}$, several other proofs have been proposed. Even though the techniques of these proofs can be modified to sequent systems other than $\mathbf{LK}$, they are essentially of a very particular nature; each of them describes an algorithm to transform a given proof to a cut-free proof. However, due to its reliance on heavy syntactic arguments and case distinctions, such an algorithm makes the fundamental structure of the argument rather opaque. We, therefore, consider rules abstractly, within the framework of logical structures familiar from universal logic \`a la Jean-Yves B\'eziau, and aim to clarify the essence of the so-called ``elimination theorems''. To do this, we first give a non-algorithmic proof of the cut-elimination theorem for the propositional fragment of $\mathbf{LK}$. From this proof, we abstract the essential features of the argument and define something called ``normal sequent structures'' relative to a particular rule. We then prove two rule-elimination theorems for these and show that one of these has a converse. Abstracting even more, we define ``abstract sequent structures'' and show that for these structures, the corresponding version of the ``rule''-elimination theorem has a converse as well.

math.LO↗

arXiv2024

Suszko's Thesis and Many-valued Logical Structures

In this article, we try to formulate a definition of ''many-valued logical structure''. For this, we embark on a deeper study of Suszko's Thesis ($\mathbf{ST}$) and show that the truth or falsity of $\mathbf{ST}$ depends, at least, on the precise notion of semantics. We propose two different notions of semantics and three different notions of entailment. The first one helps us formulate a precise definition of inferentially many-valued logical structures. The second and the third help us to generalise Suszko Reduction and provide adequate bivalent semantics for monotonic and a couple of nonmonotonic logical structures. All these lead us to a closer examination of the played by language/metalanguage hierarchy vis-\'a-vis $\mathbf{ST}$. We conclude that many-valued logical structures can be obtained if the bivalence of all the higher-order metalogics of the logic under consideration is discarded, building formal bridges between the theory of graded consequence and the theory of many-valued logical structures, culminating in generalisations of Suszko's Thesis.

math.LO↗

arXiv2024

Sign changes of the thermoelectric transport coefficient across the metal-insulator crossover in the doped Fermi Hubbard model

We investigate the doping-dependence of the Seebeck coefficient, as calculated from the Kelvin formula, for the Fermi Hubbard model using determinantal quantum Monte Carlo simulations. Our key findings are: (1) Besides the expected hole to electron-like behavior change around half filling, we show that the additional sign change at an electronic density $n_s$ (and correspondingly a hole density $p_s$) is controlled by the opening of a charge gap in the thermodynamic density of states or compressibility and not by the pseudogap scale in the single particle density of states. (2) We find that $n_s(T,U)$ depends strongly on the interaction $U$ and shows an unusual non-monotonic dependence on temperature with a maximum at a temperature $T\approx t$, on the order of the hopping scale. (3) We identify local moment formation close to half filling as the main driver for the anomalous behavior of the thermoelectric transport coefficient.

cond-mat.str-el↗

arXiv2024

Signatures of metal to insulator crossover in the repulsive Fermi Hubbard model through static correlations

Cold atom systems provide a rich platform to realize strongly interacting condensed matter systems, and recent progress in fluorescence imaging technique has enabled identification of nontrivial doublon, singlon, and holon correlation functions. We show that these correlators can be used to identify the conditions under which local moments form in an interacting electronic system. Toward this end, we report a Determinantal Quantum Monte Carlo (DQMC) study of such correlation functions in the two-dimensional repulsive Fermi Hubbard model on a square lattice as a function of doping, interaction strength and temperature. We find definite signatures of the crossover from small U(band regime) to large U(correlated insulator regime). Our key findings are: (1) An opening of a charge gap in the thermodynamic density of states is accompanied by the appearance of temperature insensitive points in the equation of state at finite doping, which can be used to distinguish the band regime in cold atom experiments. (2) Nearest neighbor doublon holon correlations track the opening of charge gap; these compete with density correlations to generate moment moment correlations that show different behavior in the metallic and correlated insulator regime. (3) Non local correlation functions can be used to distinguish between the two regimes, both at and away from half filling. Our results allow comparisons of different correlation functions with recent experimental findings and guide further experimental investigations.

cond-mat.str-el↗

arXiv2023

Autoencoder-based analytic continuation method for strongly correlated quantum systems

The single particle Green's function provides valuable information on the momentum and energy-resolved spectral properties for a strongly correlated system. In large-scale numerical calculations using quantum Monte Carlo (QMC), dynamical mean field theory (DMFT), including cluster-DMFT, one usually obtains the Green's function in imaginary-time $G(\tau)$. The process of inverting a Laplace transform to obtain the spectral function $A(\omega)$ in real-frequency is an ill-posed problem and forms the core of the analytic continuation problem. In this Letter, we propose to use a completely unsupervised autoencoder-type neural network to solve the analytic continuation problem. We introduce an encoder-decoder approach that, together with only minor physical assumptions, can extract a high-quality frequency response from the imaginary time domain. With a deeply tunable architecture, this method can, in principle, locate sharp features of spectral functions that might normally be lost using already well-established methods, such as maximum entropy (MaxEnt) methods. We demonstrate the strength of the autoencoder approach by applying it to QMC results of $G(\tau)$ for a single-band Hubbard model. The proposed method is general and can also be applied to other ill-posed inverse problems.

cond-mat.str-el↗

arXiv2023

Generalized explosion principles

Paraconsistency is commonly defined and/or characterized as the failure of a principle of explosion. The various standard forms of explosion involve one or more logical operators or connectives, among which the negation operator is the most frequent and primary. In this article, we start by asking whether a negation operator is essential for describing explosion and paraconsistency. In other words, is it possible to describe a principle of explosion and hence a notion of paraconsistency that is independent of connectives? A negation-free paraconsistency resulting from the failure of a generalized principle of explosion is presented first. We also derive a notion of quasi-negation from this and investigate its properties. Next, more general principles of explosion are considered. These are also negation-free; moreover, these principles gradually move away from the idea that an explosion requires a statement and its opposite. Thus, these principles can capture the explosion observed in logics where a statement and its negation explode only in the presence of additional information, such as in the logics of formal inconsistency.

math.LO↗

arXiv2023

A note on the distribution of prime ideals in real quadratic fields

In this note, we give a summary of the article ``The distribution of prime ideals of imaginary quadratic fields'' by G. Harman, A. Kumchev and P. A. Lewis and establish analogous results for real quadratic fields based on the same method.

math.NT↗

arXiv2023

Obfuscation of Discrete Data

Data obfuscation deals with the problem of masking a data-set in such a way that the utility of the data is maximized while minimizing the risk of the disclosure of sensitive information. To protect data we address some ways that may as well retain its statistical uses to some extent. One such way is to mask a data with additive noise and revert to certain desired parameters of the original distribution from the knowledge of the noise distribution and masked data. In this project, we discuss the estimation of any desired quantile and range of a quantitative data set masked with additive noise.

cs.CR↗

arXiv2023

Effects of lattice geometry on thermopower properties of the repulsive Hubbard model

We obtain the Seebeck coefficient or thermopower $S$, which determines the conversion efficiency from thermal to electrical energy, for the two-dimensional Hubbard model on different geometries (square, triangular, and honeycomb lattices) for different electronic densities and interaction strengths. Using Determinantal Quantum Monte Carlo (DQMC) we find the following key results: (a) the bi-partiteness of the lattice affects the doping dependence of $S$; (b) strong electronic correlations can greatly enhance $S$ and produce non-trivial sign changes as a function of doping especially in the vicinity of the Mott insulating phase; (c) $S(T)$ near half filling can show non-monotonic behavior as a function of temperature. We emphasize the role of strong interaction effects in engineering better devices for energy storage and applications, as captured by our calculations of the power factor $PF=S^2 σ$ where $σ$ is the dc conductivity.

cond-mat.str-el↗

arXiv2022

Lindenbaum-type Logical Structures

In this paper, we study some classes of logical structures from the universal logic standpoint, viz., those of the Tarski- and the Lindenbaum-types. The characterization theorems for the Tarski- and two of the four different Lindenbaum-type logical structures have been proved as well. The separations between the five classes of logical structures, viz., the four Lindenbaum-types and the Tarski-type have been established via examples. Finally, we study the logical structures that are of both Tarski- and a Lindenbaum-type, show their separations, and end with characterization, adequacy, minimality, and representation theorems for one of the Tarski-Lindenbaum-type logical structures.

math.LO↗

arXiv2022

Negation-Free Definitions of Paraconsistency

math.LO↗

arXiv2020

Imbalance for a family of one-dimensional incommensurate models with mobility edges

In this paper, we look at four generalizations of the one dimensional Aubry-Andre-Harper (AAH) model which possess mobility edges. We map out a phase diagram in terms of population imbalance, and look at the system size dependence of the steady state imbalance. We find non-monotonic behaviour of imbalance with system parameters, which contradicts the idea that the relaxation of an initial imbalance is fixed only by the ratio of number of extended states to number of localized states. We propose that there exists dimensionless parameters, which depend on the fraction of single particle localized states, single particle extended states and the mean participation ratio of these states. These ingredients fully control the imbalance in the long time limit and we present numerical evidence of this claim. Among the four models considered, three of them have interesting duality relations and their location of mobility edges are known. One of the models (next nearest neighbour coupling) has no known duality but mobility edge exists and the model has been experimentally realized. Our findings are an important step forward to understanding non-equilibrium phenomena in a family of interesting models with incommensurate potentials.

cond-mat.stat-mech↗