English
Related papers

Related papers: On the Expressive Power of First-Order Boolean Fun…

200 papers

Consider an ergodic stationary random field $A$ on the ambient space $\mathbb R^d$. In a companion article, we introduced the notion of multiscale (first-order) functional inequalities, which extend standard functional inequalities like…

Probability · Mathematics 2019-10-11 Mitia Duerinckx , Antoine Gloria

Hellerman et al. (arXiv:1505.01537) have shown that in a generic CFT the spectrum of operators carrying a large U(1) charge can be analyzed semiclassically in an expansion in inverse powers of the charge. The key is the operator state…

High Energy Physics - Theory · Physics 2017-06-28 Alexander Monin , David Pirtskhalava , Riccardo Rattazzi , Fiona K. Seibold

A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…

Logic in Computer Science · Computer Science 2011-07-08 Emmanuel Beffara

We systematically discuss candidate wave functions for the ground state of the bilayer \nu = 1 as the distance between the layers is varied. Those that describe increased intralayer correlations at finite distance show a departure from the…

Mesoscale and Nanoscale Physics · Physics 2015-06-25 M. V. Milovanovic

In quasicrystals, the phason degree of freedom and the inherent anharmonic potentials lead to complex dynamics which cannot be described by the usual phonon modes of motion. We have constructed simple one-dimensional model systems, the…

Materials Science · Physics 2010-10-11 Hansjörg Lipp , Michael Engel , Steffen Sonntag , Hans-Rainer Trebin

The execution of sequential programs allows them to be represented using mathematical functions formed by the composition of statements following one after the other. Each such statement is in itself a partial function, which allows only…

Logic in Computer Science · Computer Science 2017-08-21 Abhinav Aggarwal

Lattice induced threshold function is a Boolean function determined by a particular linear combination of lattice elements. We prove that every isotone Boolean function is a lattice induced threshold function and vice versa. We also…

Rings and Algebras · Mathematics 2013-07-05 Eszter K. Horváth , Branimir Seselja , Andreja Tepavcevic

We consider the problem of representing Boolean functions exactly by "sparse" linear combinations (over $\mathbb{R}$) of functions from some "simple" class ${\cal C}$. In particular, given ${\cal C}$ we are interested in finding…

Computational Complexity · Computer Science 2018-02-27 R. Ryan Williams

It is known that a positive Boolean function f depending on n variables has at least n + 1 extremal points, i.e. minimal ones and maximal zeros. We show that f has exactly n + 1 extremal points if and only if it is linear read-once. The…

Combinatorics · Mathematics 2018-05-28 Vadim Lozin , Igor Razgon , Viktor Zamaraev , Elena Zamaraeva , Nikolai Yu. Zolotykh

Recently, a superconducting (SC) transition from low-field (LF) to high-field (HF) SC states was reported in CeRh$_2$As$_2$, indicating the existence of multiple SC states. It has been theoretically noted that the existence of two Ce sites…

We consider negabent Boolean functions that have Trace representation. We completely characterize quadratic negabent monomial functions. We show the relation between negabent functions and bent functions via a quadratic function. Using this…

Information Theory · Computer Science 2014-06-05 Sumanta Sarkar

We characterize the languages in the individual levels of the quantifier alternation hierarchy of first-order logic with two variables by identities. This implies decidability of the individual levels. More generally we show that the…

Logic in Computer Science · Computer Science 2012-05-23 Andreas Krebs , Howard Straubing

A parallel method for computing Boolean expressions based on the properties of finite free Boolean algebras is presented. We also show how various finite combinatorial objects can be codded in the formalism of Boolean algebras and counted…

Logic in Computer Science · Computer Science 2013-10-28 Zarko Mijajlovic , Aleksandar Pejovic

For a multivariate stationary process, we develop explicit representations for the finite predictor coefficient matrices, the finite prediction error covariance matrices and the partial autocorrelation function (PACF) in terms of the…

Probability · Mathematics 2016-09-05 Akihiko Inoue , Yukio Kasahara , Mohsen Pourahmadi

We propose a novel discriminative model for sequence labeling called Bregman conditional random fields (BCRF). Contrary to standard linear-chain conditional random fields, BCRF allows fast parallelizable inference algorithms based on…

Machine Learning · Computer Science 2025-06-03 Caio Corro , Mathieu Lacroix , Joseph Le Roux

We use hypotheses from PCF theory to construct a linear ordering which has cardinality the successor of a singular cardinal of countable cofinality, and is incompact in the following sense: the ordering is not sigma-scattered, but every…

Logic · Mathematics 2025-09-23 James Cummings

We consider a class of first-order partial differential operators, acting on the space of ultradifferentiable periodic functions, and we describe their range by using the following conditions on the coefficients of the operators: the…

Analysis of PDEs · Mathematics 2023-12-08 Rafael B. Gonzalez

Motivated by the co-existing charge and spin order found in strongly correlated ladder systems, we study an effective pseudospin model on a coupled two-leg ladder. A bosonisation analysis yields a rich phase diagram showing Wigner/Peierls…

Strongly Correlated Electrons · Physics 2007-05-23 Siddhartha Lal , Mukul S. Laad

In this paper, two new classes of perfect nonlinear functions over $\mathbb{F}_{p^{2m}}$ are proposed, where $p$ is an odd prime. Furthermore, we investigate the nucleus of the corresponding semifields of these functions and show that the…

Information Theory · Computer Science 2019-05-09 Jinquan Luo , Junru Ma

We investigate the lattice of machine invariant classes. This is an infinite completely distributive lattice but it is not a Boolean lattice. We show the subword complexity and the growth function create machine invariant classes. So the…

Cryptography and Security · Computer Science 2007-05-23 Janis Buls