English
Related papers

Related papers: Extensional Uniformity for Boolean Circuits

200 papers

We initiate the study of the duality theory of locally recoverable codes, with a focus on the applications. We characterize the locality of a code in terms of the dual code, and introduce a class of invariants that refine the classical…

Information Theory · Computer Science 2022-12-16 Anina Gruica , Benjamin Jany , Alberto Ravagnani

Let $C,A$ be countable abelian groups. In this paper we determine the complexity of classifying extensions $C$ by $A$, in the cases when $C$ is torsion-free and $A$ is a $p$-group, a torsion group with bounded primary components, or a free…

Commutative Algebra · Mathematics 2025-06-24 Martino Lupini

Drawing on the classic paper by Chellas "Basic conditional logic" (1975), we propose a general algebraic framework for studying a binary operation of conditional that models universal features of the "if..., then..." connective as strictly…

Logic · Mathematics 2025-03-03 Sergio Celani , Rafał Gruszczyński , Paula Menchón

We define an order polarity to be a polarity $(X,Y,R)$ where $X$ and $Y$ are partially ordered, and we define an extension polarity to be a triple $(e_X,e_Y,R)$ such that $e_X:P\to X$ and $e_Y:P\to Y$ are poset extensions and $(X,Y,R)$ is…

Logic in Computer Science · Computer Science 2020-02-28 Rob Egrot

The paper extends the concepts of dominance and p-dissipativity to the non-smooth family of linear complementarity systems. Dominance generalizes incremental stability whereas p-dissipativity generalizes incremental passivity. The…

Systems and Control · Computer Science 2018-04-13 Felix A. Miranda-Villatoro , Fulvio Forni , Rodolphe Sepulchre

The number of instructions of an instruction sequence is taken for its logical SLOC, and is abbreviated with LLOC. A notion of quantitative expressiveness is based on LLOC and in the special case of operation over a family of single bit…

Programming Languages · Computer Science 2019-04-19 Jan A. Bergstra

The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains hard in most of the cases. In this article, we introduce…

Discrete Mathematics · Computer Science 2010-09-17 Eric Goles Chacc , Pierre-Etienne Meunier , Ivan Rapaport , Guillaume Theyssier

The classical mechanics of a finite number of degrees of freedom requires a symplectic structure on phase space C, but it is independent of any complex structure. On the contrary, the quantum theory is intimately linked with the choice of a…

Quantum Physics · Physics 2009-11-10 J. M. Isidro

Differentiable conjugacies link dynamical systems that share properties such as the stability multipliers of corresponding orbits. It provides a stronger classification than topological conjugacy, which only requires qualitative similarity.…

Dynamical Systems · Mathematics 2023-03-02 P. A. Glendinning , D. J. W. Simpson

Perturbative expansions in physical applications are generically divergent, and their physical content can be studied using Borel analysis. Given just a finite number of terms of such an expansion, this input data can be analyzed in…

High Energy Physics - Theory · Physics 2021-10-22 Ovidiu Costin , Gerald V. Dunne

We make comments on some shortcomings of the non-unitary-invariant and non-bi-invariant complexity in quantum mechanics/field theory and argue that the unitary-invariant and bi-invariant complexity is still a competitive candidate in…

High Energy Physics - Theory · Physics 2019-06-14 Run-Qiu Yang , Yu-Sen An , Chao Niu , Cheng-Yong Zhang , Keun-Young Kim

Let $\mathcal{C}$ be a finitely bicomplete category and $\mathcal{W}$ a subcategory. We prove that the existence of a model structure on $\mathcal{C}$ with $\mathcal{W}$ as subcategory of weak equivalence is not first order expressible.…

Category Theory · Mathematics 2021-02-25 Jean-Marie Droz , Inna Zakharevich

System I is a proof language for a fragment of propositional logic where isomorphic propositions, such as $A\wedge B$ and $B\wedge A$, or $A\Rightarrow(B\wedge C)$ and $(A\Rightarrow B)\wedge(A\Rightarrow C)$ are made equal. System I enjoys…

Logic in Computer Science · Computer Science 2023-09-19 Alejandro Díaz-Caro , Gilles Dowek

Let $R$ be a Noetherian ring and let $C$ be a semidualizing $R$-module. In this paper, by using relative homological dimensions with respect to $C$, we impose various conditions on $C$ to be dualizing. First, we show that $C$ is dualizing…

Commutative Algebra · Mathematics 2016-04-08 M. Rahmani , A. -J. Taherizadeh

In this article, we develop duality principles applicable to primal variational formulations found in the non-linear elasticity theory. As a first application, we establish the concerning results in details for one and three-dimensional…

Optimization and Control · Mathematics 2019-10-04 Fabio Botelho

We study the identification of causal effects in the presence of different types of constraints (e.g., logical constraints) in addition to the causal graph. These constraints impose restrictions on the models (parameterizations) induced by…

Artificial Intelligence · Computer Science 2025-10-15 Yizuo Chen , Adnan Darwiche

Standard clustering techniques assume a common configuration for all features in a dataset. However, when dealing with multi-view or longitudinal data, the clusters' number, frequencies, and shapes may need to vary across features to…

Methodology · Statistics 2025-03-26 Beatrice Franzolini , Maria De Iorio , Johan Eriksson

Let $A$ be a non-unital Banach algebra and let $A_e = A \oplus {\mathbb C}1$ be the unitization of $A$. It is true that if $A_e$ has the spectral extension property (SEP), then $A$ has the same. Does the converse hold? In this paper, we…

Functional Analysis · Mathematics 2023-06-29 H. V. Dedania , A. B. Patel

The use of a necessity modality in a typed $\lambda$-calculus can be used to separate it into two regions. These can be thought of as intensional vs. extensional data: data in the first region, the modal one, are available as code, and…

Programming Languages · Computer Science 2020-06-16 G. A. Kavvos

A simple classical, deterministic, local situation violating the Bell inequality is described. The detectors used in the experiment are ideal and the observers who decide which pair of measuring devices to choose for a given pair of…

Quantum Physics · Physics 2009-09-25 Marek Czachor
‹ Prev 1 8 9 10 Next ›